Logic for programming and automated reasoning : 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999 : proceedings

This Volume Contains The Papers Presented At The Sixth International Conference On Logic For Programming And Automated Reasoning (lpar'99), Held In Tbilisi, Georgia, September 6-10, 1999, And Hosted By The University Of Tbilisi. Forty-four Papers Were Submitted To Lpar'99. Each Of The Submissions Was Reviewed By Three Program Committee Members And An Electronic Program Com­ Mittee Meeting Was Held Via The Internet. Twenty-three Papers Were Accepted. We Would Like To Thank The Many People Who Have Made Lpar'99 Possible. We Are Grateful To The Following Groups And Individuals: To The Program Committee And The Additional Referees For Reviewing The Papers In A Very Short Time, To The Organizing Committee, And To The Local Organizers Of The Intas Workshop In Tbilisi In April 1994 (khimuri Rukhaia, Konstantin Pkhakadze, And Gela Chankvetadze). And Last But Not Least, We Would Like To Thank Konstantin - Rovin, Who Maintained The Program Committee Web Page; Uwe Waldmann, Who Supplied Macros For These Proceedings And Helped Us To Install Some Programs For The Electronic Management Of The Program Committee Work; And Bill Mccune, Who Implemented These Programs. Session 1 -- Proofs About Lists Using Ellipsis -- Session 2 -- On The Complexity Of Counting The Hilbert Basis Of A Linear Diophantine System -- Solving Combinatorial Problems With Regular Local Search Algorithms -- Evidence Algorithm And Sequent Logical Inference Search -- Session 3 -- First Order Linear Temporal Logic Over Finite Time Structures -- Model Checking Games For The Alternation-free ?-calculus And Alternating Automata -- Animating Tla Specifications -- Session 4 -- Transforming Conditional Rewrite Systems With Extra Variables Into Unconditional Systems -- Cancellative Superposition Decides The Theory Of Divisible Torsion-free Abelian Groups -- Regular Sets Of Descendants For Constructor-based Rewrite Systems -- Session 5 -- Practical Reasoning For Expressive Description Logics -- Complexity Of Terminological Reasoning Revisited -- Session 6 -- On The Complexity Of Single-rule Datalog Queries -- Session 7 -- Abstracting Properties In Concurrent Constraint Programming -- A Fixpoint Semantics For Reasoning About Finite Failure -- Extensions To The Estimation Calculus -- Session 8 -- Beth Definability For The Guarded Fragment -- Simplification Of Horn Clauses That Are Clausal Forms Of Guarded Formulas -- Session 9 -- Resource Management In Linear Logic Proof Search Revisited -- Focusing And Proof-nets In Linear And Non-commutative Logic -- Session 10 -- Chat Is ? (slg-wam) -- Proving Failure Of Queries For Definite Logic Programs Using Xsb-prolog -- A Partial Evaluation Framework For Curry Programs. Harald Ganzinger, David Mcallester, Andrei Voronkov, (eds.). Includes Bibliographical References. Proofs About Lists Using Ellipsis....Pages 1-12 On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System....Pages 13-32 Solving Combinatorial Problems with Regular Local Search Algorithms....Pages 33-43 Evidence Algorithm and Sequent Logical Inference Search....Pages 44-61 First Order Linear Temporal Logic over Finite Time Structures....Pages 62-76 Model Checking Games for the Alternation-Free μ -Calculus and Alternating Automata....Pages 77-91 Animating TLA Specifications....Pages 92-110 Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems....Pages 111-130 Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups....Pages 131-147 Regular Sets of Descendants for Constructor-Based Rewrite Systems....Pages 148-160 Practical Reasoning for Expressive Description Logics....Pages 161-180 Complexity of Terminological Reasoning Revisited....Pages 181-200 On the Complexity of Single-Rule Datalog Queries....Pages 201-222 Abstracting Properties in Concurrent Constraint Programming....Pages 223-237 A Fixpoint Semantics for Reasoning about Finite Failure....Pages 238-257 Extensions to the Estimation Calculus....Pages 258-272 Beth Definability for the Guarded Fragment....Pages 273-285 Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas....Pages 286-303 Resource Management in Linear Logic Proof Search Revisited....Pages 304-319 Focusing and Proof-Nets in Linear and Non-commutative Logic....Pages 320-336 CHAT Is Θ (SLG-WAM)....Pages 337-357 Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog....Pages 358-375 A Partial Evaluation Framework for Curry Programs....Pages 376-395 This volume contains the papers presented at the Sixth International Conference on Logic for Programming and Automated Reasoning (LPAR'99), held in Tbilisi, Georgia, September 6-10, 1999, and hosted by the University of Tbilisi. Forty-four papers were submitted to LPAR'99. Each of the submissions was reviewed by three program committee members and an electronic program com℗Ư mittee meeting was held via the Internet. Twenty-three papers were accepted. We would like to thank the many people who have made LPAR'99 possible. We are grateful to the following groups and individuals: to the program committee and the additional referees for reviewing the papers in a very short time, to the organizing committee, and to the local organizers of the INTAS workshop in Tbilisi in April 1994 (Khimuri Rukhaia, Konstantin Pkhakadze, and Gela Chankvetadze). And last but not least, we would like to thank Konstantin - rovin, who maintained the program committee Web page; Uwe Waldmann, who supplied macros for these proceedings and helped us to install some programs for the electronic management of the program committee work; and Bill McCune, who implemented these programs This book constitutes the refereed proceedings of the 6th International Conference on Logic Programming and Automated Reasoning, LPAR'99, held in Tbilisi, Georgia in September 1999. The 23 revised full papers presented were carefully reviewed and selected from 44 submissions. Among the topics addressed are logic programming, constraint logic programming, complexity aspects, logical inference search, model checking, formal specification, rewriting, practical reasoning, Horn clauses, linear logic, partial evalutation, etc