LEADER 05490nam 22007455 450 001 996465602903316 005 20200703035137.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 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic for Programming, Artificial Intelligence, and Reasoning$b[electronic resource] $e14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings /$fedited by Nachum Dershowitz, Andrei Voronkov 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XIII, 564 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$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 Artificial Intelligence ;$v4790 606 $aSoftware engineering 606 $aArtificial intelligence 606 $aComputer programming 606 $aComputer logic 606 $aMathematical logic 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aSoftware engineering. 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 0$aComputer logic. 615 0$aMathematical logic. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aArtificial Intelligence. 615 24$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 676 $a006.3 702 $aDershowitz$b Nachum$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVoronkov$b Andrei$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLPAR (Conference) 906 $aBOOK 912 $a996465602903316 996 $aLogic for Programming, Artificial Intelligence, and Reasoning$9772423 997 $aUNISA