LEADER 04526nam 2200625 a 450 001 9910768439603321 005 20200520144314.0 010 $a3-540-75560-8 024 7 $a10.1007/978-3-540-75560-9 035 $a(CKB)1000000000490758 035 $a(SSID)ssj0000318696 035 $a(PQKBManifestationID)11254472 035 $a(PQKBTitleCode)TC0000318696 035 $a(PQKBWorkID)10329674 035 $a(PQKB)10631346 035 $a(DE-He213)978-3-540-75560-9 035 $a(MiAaPQ)EBC3068646 035 $a(PPN)123728630 035 $a(EXLCZ)991000000000490758 100 $a20070911d2007 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic for programming, artificial intelligence, and reasoning $e14th international conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007 : proceedings /$fNachum Dershowitz, Andrei Voronkov (eds.) 205 $a1st ed. 2007. 210 $aBerlin ;$aNew York $cSpringer$dc2007 215 $a1 online resource (XIII, 564 p.) 225 1 $aLNCS sublibrary. SL 7, Artificial intelligence 225 1 $aLectures notes in computer science. Lecture notes in artificial intelligence,$x0302-9743 ;$v4790 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-75558-6 320 $aIncludes bibliographical references and index. 327 $aFrom 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. 410 0$aLecture notes in computer science.$pLecture notes in artificial intelligence ;$v4790. 410 0$aLNCS sublibrary.$nSL 7,$pArtificial intelligence. 517 3 $aLPAR 2007 606 $aLogic programming$vCongresses 606 $aArtificial intelligence$vCongresses 606 $aAutomatic theorem proving$vCongresses 615 0$aLogic programming 615 0$aArtificial intelligence 615 0$aAutomatic theorem proving 676 $a006.3 701 $aDershowitz$b Nachum$01354752 701 $aVoronkov$b A$g(Andrei),$f1959-$01752961 712 12$aLPAR (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768439603321 996 $aLogic for programming, artificial intelligence, and reasoning$94199516 997 $aUNINA