Logic for programming, artificial intelligence, and reasoning : 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003 : proceedings
Author(s)
Bibliographic Information
Logic for programming, artificial intelligence, and reasoning : 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003 : proceedings
（Lecture notes in computer science, 2850 . Lecture notes in artificial intelligence）
Springer, c2003
Available at / 24 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||285003036953
-
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図
V.2850007.6/L507/v.285005963200,
007.6/L507/v.285005963200 -
University of Tsukuba Library, Library on Library and Information Science
007.08-L49-285010003308187
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
ThisvolumecontainsthepaperspresentedattheTenthInternationalConference on Logic for Programming, Arti?cial Intelligence, and Reasoning (LPAR 2003), heldonSeptember22-26,2003,inAlmaty,Kazakhstan,togetherwiththeFourth International Workshop on Implementation of Logics. There were 65 submissions, of which 8 belonged to the special submission category of experimental papers, intended to describe implementations or c- parisons of systems, or experiments with systems. Each submission was reviewed by at least three program committee members and an electronic program c- mitteemeetingwasheldviatheInternet.Weareverygratefultothe32program committee members for their e?orts and for the quality of their reviews and d- cussions. Finally, the committee decided to accept 27 papers. The program also included ?ve invited talks, by Franz Baader, Serikzhan Badaev, Dexter Kozen, Sergei Goncharov, and Thomas Wilke. Apart from the program committee, we would also like to thank the other people who have made LPAR 2003 possible: the external reviewers and the local organizers Serikzhan Badaev and Anna Romina.
The Internet-based submission software and the program-committee disc- sion software were provided by the second co-chair.
Table of Contents
From Tableaux to Automata for Description Logics.- Disproving False Conjectures.- A Formal Proof of Dickson's Lemma in ACL2.- Imperative Object-Based Calculi in Co-inductive Type Theories.- Congruence Closure with Integer Offsets.- A Machine-Verified Code Generator.- A Translation Characterizing the Constructive Content of Classical Theories.- Extensions of Non-standard Inferences to Description Logics with Transitive Roles.- Extended Canonicity of Certain Topological Properties of Set Spaces.- Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics.- Improving Dependency Pairs.- On Closure under Complementation of Equational Tree Automata for Theories Extending AC.- Completeness of E-Unification with Eager Variable Elimination.- Computable Numberings.- Handling Equality in Monodic Temporal Resolution.- Once upon a Time in the West.- Ordered Diagnosis.- Computing Preferred Answer Sets in Answer Set Programming.- A Syntax-Based Approach to Reasoning about Actions and Events.- Minimizing Automata on Infinite Words.- Gandy's Theorem for Abstract Structures without the Equality Test.- Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems.- NP-Completeness Results for Deductive Problems on Stratified Terms.- Is Cantor's Theorem Automatic?.- Automatic Structures of Bounded Degree.- An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.- A Logical Study on Qualitative Default Reasoning with Probabilities.- On Structuring Proof Search for First Order Linear Logic.- Strict Geometry of Interaction Graph Models.- Connection-Based Proof Construction in Non-commutative Logic.
by "Nielsen BookData"