04410nam 2200589 a 450 991048424750332120200520144314.010.1007/b106931(CKB)1000000000212875(SSID)ssj0000318698(PQKBManifestationID)11254473(PQKBTitleCode)TC0000318698(PQKBWorkID)10311165(PQKB)11344034(DE-He213)978-3-540-32275-7(MiAaPQ)EBC3067509(PPN)123092981(EXLCZ)99100000000021287520050201d2005 uy 0engurnn#008mamaatxtccrLogic for programming, artificial intelligence, and reasoning 11th international conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005 : proceedings /Franz Baader, Andrei Voronkov (eds.)1st ed. 2005.Berlin ;New York Springerc20051 online resource (XII, 560 p.)Lecture notes in computer science,0302-9743 ;3452.Lecture notes in artificial intelligenceBibliographic Level Mode of Issuance: MonographPrinted edition: 9783540252368 Includes bibliographical references and index.CERES in Many-Valued Logics -- A Decomposition Rule for Decision Procedures by Resolution-Based Calculi -- Abstract DPLL and Abstract DPLL Modulo Theories -- Combining Lists with Non-stably Infinite Theories -- Abstract Model Generation for Preprocessing Clause Sets -- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying -- Applications of General Exact Satisfiability in Propositional Logic Modelling -- BCiC: A System for Code Authentication and Verification -- Ordered Resolution with Selection for -- On a Semantic Subsumption Test -- Suitable Graphs for Answer Set Programming -- Weighted Answer Sets and Applications in Intelligence Analysis -- How to Fix It: Using Fixpoints in Different Contexts -- Reasoning About Systems with Transition Fairness -- Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games -- How the Location of * Influences Complexity in Kleene Algebra with Tests -- The Equational Theory of ??, 0, 1,?+?, ×, ?? Is Decidable, but Not Finitely Axiomatisable -- A Trichotomy in the Complexity of Propositional Circumscription -- Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems -- Evaluating QBFs via Symbolic Skolemization -- The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs -- Automated Termination Analysis for Incompletely Defined Programs -- Automatic Certification of Heap Consumption -- A Formalization of Off-Line Guessing for Security Protocol Analysis -- Abstraction-Carrying Code -- A Verification Environment for Sequential Imperative Programs in Isabelle/HOL -- Can a Higher-Order and a First-Order Theorem Prover Cooperate? -- A Generic Framework for Interprocedural Analyses of Numerical Properties -- Second-Order Matching via Explicit Substitutions -- Knowledge-Based Synthesis of Distributed Systems Using Event Structures -- The Inverse Method for the Logic of Bunched Implications -- Cut-Elimination: Experiments with CERES -- Uniform Rules and Dialogue Games for Fuzzy Logics -- Nonmonotonic Description Logic Programs: Implementation and Experiments -- Implementing Efficient Resource Management for Linear Logic Programming -- Layered Clausal Resolution in the Multi-modal Logic of Beliefs and Goals.Lecture notes in computer science.Lecture notes in artificial intelligence ;3452.LPAR 2004Logic programmingCongressesAutomatic theorem provingCongressesArtificial intelligenceCongressesLogic programmingAutomatic theorem provingArtificial intelligence005.1/15Baader Franz62009Voronkov A(Andrei),1959-1752961LPAR (Conference)MiAaPQMiAaPQMiAaPQBOOK9910484247503321Logic for programming, artificial intelligence, and reasoning4188473UNINA