This volume contains the papers presented at the Eighth International C- ference on Logic for Programming, Arti?cial Intelligence and Reasoning (LPAR 2001), held on December 3-7, 2001, at the University of Havana (Cuba), together with the Second International Workshop on Implementation of Logics. There were 112 submissions, of which 19 belonged to the special subm- sion category of experimental papers, intended to describe implementations or comparisons of systems, or experiments with systems. Each submission was - viewed by at least three program committee members and an electronic program committee meeting was held via the Internet. The high number of submissions caused a large amount of work, and we are very grateful to the other 31 PC members for their e?ciency and for the quality of their reviews and discussions. Finally, the committee decided to accept 40papers in the theoretical ca- gory, and 9 experimental papers. In addition to the refereed papers, this volume contains an extended abstract of the invited talk by Frank Wolter. Two other invited lectures were given by Matthias Baaz and Manuel Hermenegildo. Apart from the program committee, we would also like to thank the other people who made LPAR 2001 possible: the additional referees; the Local Arran- ` gements Chair Luciano Garc´?a; Andr´es Navarro and Oscar Guell, ¨ who ran the internet-based submission software and the program committee discussion so- ware at the LSI Department lab in Barcelona; and Bill McCune, whose program committee management software was used.
Author(s): Ian Hodkinson, Frank Wolter, Michael Zakharyaschev (auth.), Robert Nieuwenhuis, Andrei Voronkov (eds.)
Series: Lecture Notes in Computer Science 2250 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001
Language: English
Pages: 741
Tags: Artificial Intelligence (incl. Robotics); Logics and Meanings of Programs; Software Engineering; Mathematical Logic and Formal Languages
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.....Pages 1-23
On Bounded Specifications....Pages 24-38
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy....Pages 39-54
Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets....Pages 55-69
Games and Model Checking for Guarded Logics....Pages 70-84
Computational Space Efficiency and Minimal Model Generation for Guarded Formulae....Pages 85-99
Logical Omniscience and the Cost of Deliberation....Pages 100-109
Local Conditional High-Level Robot Programs....Pages 110-124
A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents....Pages 125-141
Proof and Model Generation with Disconnection Tableaux....Pages 142-156
Counting the Number of Equivalent Binary Resolution Proofs....Pages 157-171
Splitting through New Proposition Symbols....Pages 172-185
Complexity of Linear Standard Theories....Pages 186-200
Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving....Pages 201-216
Unification in a Description Logic with Transitive Closure of Roles....Pages 217-232
Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions....Pages 233-248
Coherence and Transitivity in Coercive Subtyping....Pages 249-265
A Type-Theoretic Approach to Induction with Higher-Order Encodings....Pages 266-281
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification....Pages 282-298
Model Generation with Boolean Constraints....Pages 299-308
First-Order Atom Definitions Extended....Pages 309-319
Automated Proof Support for Interval Logics....Pages 320-329
The Functions Provable by First Order Abstraction....Pages 330-346
A Local System for Classical Logic....Pages 347-361
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae....Pages 362-376
Permutation Problems and Channelling Constraints....Pages 377-391
Simplifying Binary Propositional Theories into Connected Components Twice as Fast....Pages 392-406
Reasoning about Evolving Nonmonotonic Knowledge Bases....Pages 407-421
Efficient Computation of the Well-Founded Model Using Update Propagation....Pages 422-437
Indexed Categories and Bottom-Up Semantics of Logic Programs....Pages 438-454
Functional Logic Programming with Failure: A Set-Oriented View....Pages 455-469
Operational Semantics for Fixed-Point Logics on Constraint Databases....Pages 470-484
Efficient Negation Using Abstract Interpretation....Pages 485-494
Certifying Synchrony for Free....Pages 495-506
A Computer Environment for Writing Ordinary Mathematical Proofs....Pages 507-516
On Termination of Meta-programs....Pages 517-530
A Monotonic Higher-Order Semantic Path Ordering....Pages 531-547
The Elog Web Extraction Language....Pages 548-560
Census Data Repair: A Challenging Application of Disjunctive Logic Programming....Pages 561-578
Boolean Functions for Finite-Tree Dependencies....Pages 579-594
How to Transform an Analyzer into a Verifier....Pages 595-609
Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Search....Pages 610-623
Coherent Composition of Distributed Knowledge-Bases through Abduction....Pages 624-638
Tableaux for Reasoning about Atomic Updates....Pages 639-653
Inference of Termination Conditions for Numerical Loops in Prolog....Pages 654-669
Termination of Rewriting with Strategy Annotations....Pages 669-684
Inferring Termination Conditions for Logic Programs Using Backwards Analysis....Pages 685-694
Reachability Analysis of Term Rewriting Systems with Timbuk....Pages 695-706
Binding-Time Annotations without Binding-Time Analysis....Pages 707-722
Concept Formation via Proof Planning Failure....Pages 723-736
