LEADER 04410nam 2200589 a 450 001 9910484247503321 005 20200520144314.0 024 7 $a10.1007/b106931 035 $a(CKB)1000000000212875 035 $a(SSID)ssj0000318698 035 $a(PQKBManifestationID)11254473 035 $a(PQKBTitleCode)TC0000318698 035 $a(PQKBWorkID)10311165 035 $a(PQKB)11344034 035 $a(DE-He213)978-3-540-32275-7 035 $a(MiAaPQ)EBC3067509 035 $a(PPN)123092981 035 $a(EXLCZ)991000000000212875 100 $a20050201d2005 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic for programming, artificial intelligence, and reasoning $e11th international conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005 : proceedings /$fFranz Baader, Andrei Voronkov (eds.) 205 $a1st ed. 2005. 210 $aBerlin ;$aNew York $cSpringer$dc2005 215 $a1 online resource (XII, 560 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3452.$aLecture notes in artificial intelligence 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540252368 320 $aIncludes bibliographical references and index. 327 $aCERES 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. 410 0$aLecture notes in computer science.$pLecture notes in artificial intelligence ;$v3452. 517 3 $aLPAR 2004 606 $aLogic programming$vCongresses 606 $aAutomatic theorem proving$vCongresses 606 $aArtificial intelligence$vCongresses 615 0$aLogic programming 615 0$aAutomatic theorem proving 615 0$aArtificial intelligence 676 $a005.1/15 701 $aBaader$b Franz$062009 701 $aVoronkov$b A$g(Andrei),$f1959-$01752961 712 12$aLPAR (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484247503321 996 $aLogic for programming, artificial intelligence, and reasoning$94188473 997 $aUNINA