05490nam 22007455 450 99646560290331620200703035137.03-540-75560-810.1007/978-3-540-75560-9(CKB)1000000000490758(SSID)ssj0000318696(PQKBManifestationID)11254472(PQKBTitleCode)TC0000318696(PQKBWorkID)10329674(PQKB)10631346(DE-He213)978-3-540-75560-9(MiAaPQ)EBC3068646(PPN)123728630(EXLCZ)99100000000049075820100301d2007 u| 0engurnn#008mamaatxtccrLogic for Programming, Artificial Intelligence, and Reasoning[electronic resource] 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings /edited by Nachum Dershowitz, Andrei Voronkov1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (XIII, 564 p.)Lecture Notes in Artificial Intelligence ;4790Bibliographic Level Mode of Issuance: Monograph3-540-75558-6 Includes bibliographical references and index.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.Lecture Notes in Artificial Intelligence ;4790Software engineeringArtificial intelligenceComputer programmingComputer logicMathematical logicSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Software engineering.Artificial intelligence.Computer programming.Computer logic.Mathematical logic.Software Engineering/Programming and Operating Systems.Artificial Intelligence.Programming Techniques.Software Engineering.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.006.3Dershowitz Nachumedthttp://id.loc.gov/vocabulary/relators/edtVoronkov Andreiedthttp://id.loc.gov/vocabulary/relators/edtLPAR (Conference)BOOK996465602903316Logic for Programming, Artificial Intelligence, and Reasoning772423UNISA