This book constitutes the refereed proceedings of the 10th International Conference on Logic Programming, Artificial Intelligence, and Reasoning, LPAR 2003, held in Almaty, Kazakhstan in September 2003.
The 27 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 65 submissions. The papers address all current issues in logic programming, automated reasoning, and AI logics in particular description logics, proof theory, logic calculi, formal verification, model theory, game theory, automata, proof search, constraint systems, model checking, and proof construction.
Author(s): Franz Baader, Jan Hladik, Carsten Lutz (auth.), Moshe Y. Vardi, Andrei Voronkov (eds.)
Series: Lecture Notes in Computer Science 2850 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003
Language: English
Pages: 436
Tags: Artificial Intelligence (incl. Robotics); Programming Techniques; Software Engineering; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
Front Matter....Pages -
From Tableaux to Automata for Description Logics....Pages 1-32
Disproving False Conjectures....Pages 33-48
A Formal Proof of Dickson’s Lemma in ACL2....Pages 49-58
Imperative Object-Based Calculi in Co-inductive Type Theories....Pages 59-77
Congruence Closure with Integer Offsets....Pages 78-90
A Machine-Verified Code Generator....Pages 91-106
A Translation Characterizing the Constructive Content of Classical Theories....Pages 107-121
Extensions of Non-standard Inferences to Description Logics with Transitive Roles....Pages 122-136
Extended Canonicity of Certain Topological Properties of Set Spaces....Pages 137-151
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics....Pages 152-166
Improving Dependency Pairs....Pages 167-182
On Closure under Complementation of Equational Tree Automata for Theories Extending AC....Pages 183-197
Completeness of E -Unification with Eager Variable Elimination....Pages 198-212
Computable Numberings....Pages 213-213
Handling Equality in Monodic Temporal Resolution....Pages 214-228
Once upon a Time in the West....Pages 229-243
Ordered Diagnosis....Pages 244-258
Computing Preferred Answer Sets in Answer Set Programming....Pages 259-273
A Syntax-Based Approach to Reasoning about Actions and Events....Pages 274-288
Minimizing Automata on Infinite Words....Pages 289-289
Gandy’s Theorem for Abstract Structures without the Equality Test....Pages 290-301
Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems....Pages 302-316
NP-Completeness Results for Deductive Problems on Stratified Terms....Pages 317-331
Is Cantor’s Theorem Automatic?....Pages 332-345
Automatic Structures of Bounded Degree....Pages 346-360
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems....Pages 361-375
A Logical Study on Qualitative Default Reasoning with Probabilities....Pages 376-388
On Structuring Proof Search for First Order Linear Logic....Pages 389-406
Strict Geometry of Interaction Graph Models....Pages 407-421
Connection-Based Proof Construction in Non-commutative Logic....Pages 422-436
Back Matter....Pages -
