Logic for programming, artificial intelligence, and reasoning : 8th international conference, LPAR 2001, Havana, Cuba, December 3-7, 2001 : proceedings /
This book constitutes the refereed proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2001, held in Havana, Cuba, in December 2001. The 40 revised full papers presented together with an invited paper were carefully reviewed and sele...
| Corporate Authors: | , |
|---|---|
| Other Authors: | , , |
| Format: | Conference Proceeding Book |
| Language: | English |
| Published: |
Berlin :
Springer,
2001
Berlin ; Heidelberg : ©2001 Berlin ; New York : 2001 Berlin ; New York : c2001 |
| Series: | Lecture notes in computer science ;
2250 Lecture notes in computer science Lecture notes in artificial intelligence Lecture notes in computer science Lecture notes in artificial intelligence. Lecture notes in computer science 2250 |
| Subjects: |
Table of Contents:
- Invited Talk
- Monodic Fragments of First-Order Temporal Logics: 2000-2001 A.D.
- Verification
- On Bounded Specifications
- Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
- Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
- Guarded Logics
- Games and Model Checking for Guarded Logics
- Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
- Agents
- Logical Omniscience and the Cost of Deliberation
- Local Conditional High-Level Robot Programs
- A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents
- Automated Theorem Proving
- Proof and Model Generation with Disconnection Tableaux
- Counting the Number of Equivalent Binary Resolution Proofs
- Automated Theorem Proving
- Splitting through New Proposition Symbols
- Complexity of Linear Standard Theories
- Herbrand's Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
- Non-classical Logics
- Unification in a Description Logic with Transitive Closure of Roles
- Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions
- Types
- Coherence and Transitivity in Coercive Subtyping
- A Type-Theoretic Approach to Induction with Higher-Order Encodings
- Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
- Experimental Papers
- Model Generation with Boolean Constraints
- First-Order Atom Definitions Extended
- Automated Proof Support for Interval Logics
- Foundations of Logic
- The Functions Provable by First Order Abstraction
- A Local System for Classical Logic
- CSP and SAT
- Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
- Permutation Problems and Channelling Constraints
- Simplifying Binary Propositional Theories into Connected Components Twice as Fast
- Non-monotonic Reasoning
- Reasoning about Evolving Nonmonotonic Knowledge Bases
- Efficient Computation of the Well-Founded Model Using Update Propagation
- Semantics
- Indexed Categories and Bottom-Up Semantics of Logic Programs
- Functional Logic Programming with Failure: A Set-Oriented View
- Operational Semantics for Fixed-Point Logics on Constraint Databases
- Experimental Papers
- Efficient Negation Using Abstract Interpretation
- Certifying Synchrony for Free
- A Computer Environment for Writing Ordinary Mathematical Proofs
- Termination
- On Termination of Meta-programs
- A Monotonic Higher-Order Semantic Path Ordering
- Knowledge-Based Systems
- The Elog Web Extraction Language
- Census Data Repair: A Challenging Application of Disjunctive Logic Programming
- Analysis of Logic Programs
- Boolean Functions for Finite-Tree Dependencies
- How to Transform an Analyzer into a Verifier
- Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Search
- Databases and Knowledge Bases
- Coherent Composition of Distributed Knowledge-Bases through Abduction
- Tableaux for Reasoning about Atomic Updates
- Termination
- Inference of Termination Conditions for Numerical Loops in Prolog
- Termination of Rewriting with Strategy Annotations
- Inferring Termination Conditions for Logic Programs Using Backwards Analysis
- Program Analysis and Proof Planning
- Reachability Analysis of Term Rewriting Systems with Timbuk
- Binding-Time Annotations without Binding-Time Analysis
- Concept Formation via Proof Planning Failure
- Monodic Fragments of First-Order Temporal Logics: 2000-2001 A.D. / Ian Hodkinson, Frank Wolter and Michael Zakharyaschev
- On Bounded Specifications / Orna Kupferman and Moshe Y. Vardi
- Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy / Klaus Schneider
- Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets / Volker Diekert and Paul Gastin
- Games and Model Checking for Guarded Logics / Dietmar Berwanger and Erich Gradel
- Computational Space Efficiency and Minimal Model Generation for Guarded Formulae / Lilia Georgieva, Ullrich Hustadt and Renate A. Schmidt
- Logical Omniscience and the Cost of Deliberation / Natasha Alechina and Brian Logan
- Local Conditional High-Level Robot Programs / Sebastian Sardina
- A Refinement Theory That Supports Reasoning about Knowledge and Time for Synchronous Agents / Kai Engelhardt, Ron van der Meyden and Yoram Moses
- Proof and Model Generation with Disconnection Tableaux / Reinhold Letz and Gernot Stenz
- Counting the Number of Equivalent Binary Resolution Proofs / Joseph D. Horton
- Splitting through New Proposition Symbols / Hans de Nivelle
- Complexity of Linear Standard Theories / Christopher Lynch and Barbara Morawska
- Herbrand's Theorem for Prenex Godel Logic and Its Consequences for Theorem Proving / Matthias Baaz, Agata Ciabattoni and Christian G. Fermuller
- Unification in a Description Logic with Transitive Closure of Roles / Franz Baader and Ralf Kusters
- Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions / Guy Perrier
- Coherence and Transitivity in Coercive Subtyping / Yong Luo and Zhaohui Luo
- A Type-Theoretic Approach to Induction with Higher-Order Encodings / Carsten Schurmann
- Analysis of Polymorphically Typed Logic Programs Using ACI-Unification / Jan-Georg Smaus
- Boolean Functions for Finite-Tree Dependencies / Roberto Bagnara, Enea Zaffanella and Roberta Gori / [et al.]
- How to Transform an Analyzer into a Verifier / Marco Comini, Roberta Gori and Giorgio Levi
- Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Search / Rong Yang and Steve Gregory
- Coherent Composition of Distributed Knowledge-Bases through Abduction / Ofer Arieli, Bert Van Nuffelen and Marc Denecker / [et al.]
- Tableaux for Reasoning about Atomic Updates / Christian G. Fermuller, Georg Moser and Richard Zach
- Inference of Termination Conditions for Numerical Loops in Prolog / Alexander Serebrenik and Danny De Schreye
- Termination of Rewriting with Strategy Annotations / Salvador Lucas
- Inferring Termination Conditions for Logic Programs Using Backwards Analysis / Samir Genaim and Michael Codish
- Reachability Analysis of Term Rewriting Systems with Timbuk / Thomas Genet and Valerie Viet Triem Tong
- Binding-Time Annotations without Binding-Time Analysis / Wim Vanhoof and Maurice Bruynooghe
- Concept Formation via Proof Planning Failure / Raul Monroy
- Model Generation with Boolean Constraints / Miyuki Koshimura, Hiroshi Fujita and Ryuzo Hasegawa
- First-Order Atom Definitions Extended / Bijan Afshordel, Thomas Hillenbrand and Christoph Weidenbach
- Automated Proof Support for Interval Logics / Thomas Marthedal Rasmussen
- The Functions Provable by First Order Abstraction / Daniel Leivant
- A Local System for Classical Logic / Kai Brunnler and Alwen Fernanto Tiu
- Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae / Jussi Rintanen
- Permutation Problems and Channelling Constraints / Toby Walsh
- Simplifying Binary Propositional Theories into Connected Components Twice as Fast / Alvaro del Val
- Reasoning about Evolving Nonmonotonic Knowledge Bases / Thomas Eiter, Michael Fink and Giuliana Sabbatini / [et al.]
- Efficient Computation of the Well-Founded Model Using Update Propagation / Andreas Behrend
- Indexed Categories and Bottom-Up Semantics of Logic Programs / Gianluca Amato and James Lipton
- Functional Logic Programming with Failure: A Set-Oriented View / F. J. Lopez-Fraguas and J. Sanchez-Hernandez
- Operational Semantics for Fixed-Point Logics on Constraint Databases / Stephan Kreutzer
- Efficient Negation Using Abstract Interpretation / Susana Munoz, Juan Jose Moreno and Manuel Hermenegildo
- Certifying Synchrony for Free / Sylvain Boulme and Gregoire Hamon
- A Computer Environment for Writing Ordinary Mathematical Proofs / David McMath, Marianna Rozenfeld and Richard Sommer
- On Termination of Meta-programs / Alexander Serebrenik and Danny De Schreye
- A Monotonic Higher-Order Semantic Path Ordering / Cristina Borralleras and Albert Rubio
- The Elog Web Extraction Language / Robert Baumgartner, Sergio Flesca and Georg Gottlob
- Census Data Repair: A Challenging Application of Disjunctive Logic Programming / Enrico Franconi, Antonio Laureti Palma and Nicola Leone / [et al.]