Logic for Programming, Artificial Intelligence and Reasoning Ed by Nachum Dershowitz and Andrei Voronkov
By: Dershowitz, Nachum.
Contributor(s): Voronkov, Andrei.Material type: BookSeries: Lecture Notes in Artificial Intelligence. Publisher: Heidelberg Springer-Verlag 2007Description: 562p.ISBN: 9783540755586.Subject(s): Computer EngineeringDDC classification: 006.3
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
|Book||Institute of Technology||Reference||006.3 LOG (Browse shelf)||Not For Loan||T0037768|
Browsing Institute of Technology Shelves , Collection code: Reference Close shelf browser
14th International Conference, LPAR 2007 Yerevan, America, October 15-19 2007 LNAI 4790 From Hilbert's Program to a Logic Toolbox (Invited Talk) On the Notion of Vacuous Truth (Invited Talk) Whatever Happened to Deductive Question Answering? (Invited Talk) 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 Fix point Logic Monadic Fragments of Godel 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 Pmnf 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 El 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 £C Family of Description Logics An Extension of the Knuth-Bendix Ordering with LPO-Likc 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 /i-Calculus Pushdown Module Checking Approved Models for Normal Logic Programs Permutative Additives and Exponentials Algorithms for Propositional Model Counting Completeness for Flat Modal Fix point Logics (Extended Abstract) 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 Author Index