Logic for Programming, Artificial Intelligence, and Reasoning: 11th International Workshop, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings

ISBN-13: 9783540252368 / Angielski / Miękka / 2005 / 560 str.

Franz Baader;Andrei Voronkov

Opis

This volume contains the papers presented at the 11th International Conference on Logic for Programming, Arti?cial Intelligence, and Reasoning (LPAR), held from March 14 to 18, 2005, in Montevideo, Uruguay, together with the 5th - ternational Workshop on the Implementation of Logics (organized by Stephan Schulz and Boris Konev) and the Workshop on Analytic Proof Systems (or- nized by Matthias Baaz). The call for papers attracted 77 paper submissions, each of which was - viewed by at least three expert reviewers. The ?nal decisions on the papers were taken during an electronic Program Committee meeting held on the Internet. The Internet-based submission, reviewing, and discussion software EasyChair, provided by the second PC co-chair, supported each stage of the reviewing p- cess. But the most important work was, of course, done by the 34 PC members and their external reviewers, who provided high-quality reviews. After intense discussions to resolve con?icts among the reviewers, the Program Committee decided to accept 33 papers. The conference program also included 4 invited talks, by Jurgen ] Giesl, Al- ander Leitsch, Helmut Seidl, and Igor Walukiewicz, which are documented by short or extended abstracts in these proceedings. In addition, Mart ?n Abadi held a tutorial on Reasoning About Security Protocols, and Ian Horrocks on Description Logic Reasoning."

Spis treści

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.