Logic for Programming, Artificial Intelligence, and Reasoning: 9th International Conference, Lpar 2002, Tbilisi, Georgia, October 14-18, 2002 Proceedi

ISBN-13: 9783540000105 / Angielski / Miękka / 2002 / 470 str.

M. Baaz; V. Andrei; Matthias Baaz

Opis

This book constitutes the refereed proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002, held in Tbilisi, Georgia in October 2002.
The 30 revised full papers presented were carefully reviewed and selected from 68 submissions. Among the topics covered are constraint programming, formal software enginering, formal verification, resolution, unification, proof planning, agent splitting, binary decision diagrams, binding, linear logic, Isabelle theorem prover, guided reduction, etc.

Spis treści

Improving On-Demand Strategy Annotations.- First-Order Logic as a Constraint Programming Language.- Maintenance of Formal Software Developments by Stratified Verification.- A Note on Universal Measures for Weak Implicit Computational Complexity.- Extending Compositional Message Sequence Graphs.- Searching for Invariants Using Temporal Resolution.- Proof Planning for Feature Interactions: A Preliminary Report.- An Extension of BDICTL with Functional Dependencies and Components.- Binding Logic: Proofs and Models.- Directed Automated Theorem Proving.- A Framework for Splitting BDI Agents.- On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.- Using BDDs with Combinations of Theories.- On Expressive Description Logics with Composition of Roles in Number Restrictions.- Query Optimization of Disjunctive Databases with Constraints through Binding Propagation.- A Non-commutative Extension of MELL.- Procedural Semantics for Fuzzy Disjunctive Programs.- Pushdown Specifications.- Theorem Proving with Sequence Variables and Flexible Arity Symbols.- Games, Probability, and the Quantitative ?-Calculus qM?.- Parallelism and Tree Regular Constraints.- Gödel Logics and Cantor-Bendixon Analysis.- A Semantics for Proof Plans with Applications to Interactive Proof Planning.- An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction.- Proof Development with ?MEGA: ?2 Is Irrational.- A Local System for Linear Logic.- Investigating Type-Certifying Compilation with Isabelle.- Automating Type Soundness Proofs via Decision Procedures and Guided Reductions.- Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics.- Fuzzy Prolog: A Simple General Implementation Using (R).