This book constitutes the refereed proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2007, held in Yerevan, Armenia. It contains 36 revised full papers, 15 short papers and three invited talks that were carefully selected from 78 submissions. The papers address all current issues in logic programming, logic-based program manipulation, formal method, automated reasoning, and various kinds of AI logics.

Produktinformation

Utgivningsdatum2007-10-08
Mått155 x 235 x 32 mm
Vikt867 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor564
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540755586

Tillhör följande kategorier

Programmeringsböcker inom Data och IT

From Hilbert’s Program to a Logic Toolbox.- On the Notion of Vacuous Truth.- Whatever Happened to Deductive Question Answering?.- Decidable Fragments of Many-Sorted Logic.- One-Pass Tableaux for Computation Tree Logic.- Extending a Resolution Prover for Inequalities on Elementary Functions.- Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic.- Monadic Fragments of Gödel Logics: Decidability and Undecidability Results.- Least and Greatest Fixed Points in Linear Logic.- The Semantics of Consistency and Trust in Peer Data Exchange Systems.- Completeness and Decidability in Sequence Logic.- HORPO with Computability Closure: A Reconstruction.- Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs.- Matching in Hybrid Terminologies.- Verifying Cryptographic Protocols with Subterms Constraints.- Deciding Knowledge in Security Protocols for Monoidal Equational Theories.- Mechanized Verification of CPS Transformations.- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap.- Protocol Verification Via Rigid/Flexible Resolution.- Preferential Description Logics.- On Two Extensions of Abstract Categorial Grammars.- Why Would You Trust B?.- How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited.- On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards.- Data Complexity in the Family of Description Logics.- An Extension of the Knuth-Bendix Ordering with LPO-Like Properties.- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic.- Integrating Inductive Definitions in SAT.- The Separation Theorem for Differential Interaction Nets.- Complexity of Planning in Action Formalisms Based on Description Logics.- Faster Phylogenetic Inferencewith MXG.- Enriched ?–Calculus Pushdown Module Checking.- Approved Models for Normal Logic Programs.- Permutative Additives and Exponentials.- Algorithms for Propositional Model Counting.- Completeness for Flat Modal Fixpoint Logics.- : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols.- The Complexity of Temporal Logic with Until and Since over Ordinals.- ATP Cross-Verification of the Mizar MPTP Challenge Problems.

Mer från samma författare

Calendrical Tabulations, 1900-2200

Edward M. Reingold, Nachum Dershowitz

Inbunden, 2002

3 919 kr

Calendrical Calculations

Edward M. Reingold, Nachum Dershowitz

Inbunden, 2018

2 339 kr

Calendrical Calculations

Edward M. Reingold, Nachum Dershowitz

Häftad, 2018

889 kr

Del 12180

Fields of Logic and Computation III

Andreas Blass, Patrick Cégielski, Nachum Dershowitz, Manfred Droste, Bernd Finkbeiner

Häftad, 2020

749 kr

Del 9300

Fields of Logic and Computation II

Lev D. Beklemishev, Andreas Blass, Nachum Dershowitz, Bernd Finkbeiner, Wolfram Schulte

Häftad, 2015

719 kr

Verification: Theory and Practice

Nachum Dershowitz

Häftad, 2004

1 479 kr

Rewriting Techniques and Applications

Nachum Dershowitz

Häftad, 1989

719 kr

Conditional and Typed Rewriting Systems

Nachum Dershowitz, Naomi Lindenstrauss

Häftad, 1995

749 kr

Pillars of Computer Science

Arnon Avron, Nachum Dershowitz, Alexander Rabinovich

Häftad, 2008

1 479 kr

Unconventional Computation

Christian S. Calude, Jose Felix Gomes da Costa, Nachum Dershowitz, Elisabete Freire, Grzegorz Rozenberg

Häftad, 2009

719 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

969 kr

Du kanske också är intresserad av

Logic for Programming, Artificial Intelligence, and Reasoning

Miki Hermann, Andrei Voronkov

Häftad, 2006

1 479 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Christian G. Fermüller, Andrei Voronkov

Häftad, 2010

1 479 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Ken McMillan, Aart Middeldorp, Andrei Voronkov

Häftad, 2013

749 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov

Häftad, 2015

749 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Moshe Vardi, Andrei Voronkov

Häftad, 2003

749 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Iliano Cervesato, Helmut Veith, Andrei Voronkov

Häftad, 2008

1 479 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Nikolaj Bjørner, Andrei Voronkov

Häftad, 2012

749 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Geoff Sutcliffe, Andrei Voronkov

Häftad, 2005

1 479 kr

Logic for Programming, Artificial Intelligence, and Reasoning

Robert Nieuwenhuis, Andrei Voronkov

Häftad, 2001

1 479 kr

Pillars of Computer Science

Arnon Avron, Nachum Dershowitz, Alexander Rabinovich

Häftad, 2008

1 479 kr

Del i serien Lecture Notes in Computer Science

Logic for Programming, Artificial Intelligence, and Reasoning

14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings

Häftad, Engelska, 2007

AvNachum Dershowitz,Andrei Voronkov

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (9)

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2007-10-08
Mått155 x 235 x 32 mm
Vikt867 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor564
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540755586

Tillhör följande kategorier

Programmeringsböcker inom Data och IT

From Hilbert’s Program to a Logic Toolbox.- On the Notion of Vacuous Truth.- Whatever Happened to Deductive Question Answering?.- Decidable Fragments of Many-Sorted Logic.- One-Pass Tableaux for Computation Tree Logic.- Extending a Resolution Prover for Inequalities on Elementary Functions.- Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic.- Monadic Fragments of Gödel Logics: Decidability and Undecidability Results.- Least and Greatest Fixed Points in Linear Logic.- The Semantics of Consistency and Trust in Peer Data Exchange Systems.- Completeness and Decidability in Sequence Logic.- HORPO with Computability Closure: A Reconstruction.- Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs.- Matching in Hybrid Terminologies.- Verifying Cryptographic Protocols with Subterms Constraints.- Deciding Knowledge in Security Protocols for Monoidal Equational Theories.- Mechanized Verification of CPS Transformations.- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap.- Protocol Verification Via Rigid/Flexible Resolution.- Preferential Description Logics.- On Two Extensions of Abstract Categorial Grammars.- Why Would You Trust B?.- How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited.- On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards.- Data Complexity in the Family of Description Logics.- An Extension of the Knuth-Bendix Ordering with LPO-Like Properties.- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic.- Integrating Inductive Definitions in SAT.- The Separation Theorem for Differential Interaction Nets.- Complexity of Planning in Action Formalisms Based on Description Logics.- Faster Phylogenetic Inferencewith MXG.- Enriched ?–Calculus Pushdown Module Checking.- Approved Models for Normal Logic Programs.- Permutative Additives and Exponentials.- Algorithms for Propositional Model Counting.- Completeness for Flat Modal Fixpoint Logics.- : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols.- The Complexity of Temporal Logic with Until and Since over Ordinals.- ATP Cross-Verification of the Mizar MPTP Challenge Problems.