Logic for programming, artificial intelligence, and reasoning : 14th international conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007 : proceedings / / Nachum Dershowitz, Andrei Voronkov (eds.)

• Pubblicazione: Berlin ; ; New York, : Springer, c2007
• Edizione: 1st ed. 2007.
• Descrizione fisica: 1 online resource (XIII, 564 p.)
• Disciplina: 006.3
• Soggetto topico: Logic programming; Artificial intelligence; Automatic theorem proving
• Altri autori: DershowitzNachum VoronkovA <1959-> (Andrei)
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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 Inference with 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.
• Altri titoli varianti: LPAR 2007
• Titolo autorizzato: Logic for programming, artificial intelligence, and reasoning
• ISBN: 3-540-75560-8
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910768439603321
• Lo trovi qui: Univ. Federico II
• Serie: Lecture notes in computer science. . -Lecture notes in artificial intelligence ; ; 4790.; LNCS sublibrary. : SL 7, . -Artificial intelligence.