Logic for Programming, Artificial Intelligence, and Reasoning [electronic resource] : 11th International Workshop, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings / edited by Franz Baader, Andrei Voronkov.

Corporate author
1st ed. 2005.
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
1 online resource (XII, 560 p.)


Related name
Lecture Notes in Artificial Intelligence ; 3452 [More in this series]
Subseries of
Lecture notes in computer science
Bibliographic Level Mode of Issuance: Monograph
Bibliographic references
Includes bibliographical references and index.
Language note
  • CERES 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.
  • 3-540-32275-2
  • 3-540-25236-3
  • 10.1007/b106931
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...
Other views
Staff view