Detecting Unsolvable Queries for Definite Logic Programs

In logic programming, almost no work has been done so far on proving that certain queries cannot succeed. Work in this direction could be useful for queries which seem to be non-terminating. Such queries are not exceptional, e.g. in planning problems. The paper develops some methods, based on abduction, goal-directedness, tabulation, and constraint techniques, for proving failure of queries for definite logic programs. It also reports some experiments with various tools.

[1]  John K. Slaney,et al.  FINDER: Finite Domain Enumerator - System Description , 1994, CADE.

[2]  David Scott Warren,et al.  Memoing for logic programs , 1992, CACM.

[3]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[4]  John P. Gallagher,et al.  Fast and Precise Regular Approximations of Logic Programs , 1994, ICLP.

[5]  John W. Lloyd.  Practical Model-Based Static Analysis for Definite Logic Programs , 1995 .

[6]  Maurizio Gabbrielli,et al.  The s-Semantics Approach: Theory and Applications , 1994, J. Log. Program..

[7]  Danny De Schreye,et al.  SLDNFA: An Abductive Procedure for Abductive Logic Programs , 1998, J. Log. Program..

[8]  Nevin Charles Heintze,et al.  Set based program analysis , 1992 .

[9]  Hantao Zhang,et al.  SEM: a System for Enumerating Models , 1995, IJCAI.

[10]  Maria Paola Bonacina,et al.  On Rewrite Programs: Semantics and Relationship with Prolog , 1992, J. Log. Program..

[11]  Michael Thielscher,et al.  The generation of pre-interpretations for detecting unsolvable planning problems , 1997, IJCAI 1997.

[12]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[13]  Bart Demoen,et al.  Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand , 1993, ILPS.

[14]  John P. Gallagher,et al.  Practical Model-Based Static Analysis for Definite Logic Programs , 1995, ILPS.

[15]  Marc Denecker,et al.  Abductive inductive logic programming , 1995, IJCAI 1995.

[16]  Konstantinos Sagonas,et al.  Xsb as an Eecient Deductive Database Engine , 1994 .

[17]  M. Sørensen,et al.  Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments , 1999, J. Log. Program..

[18]  Krzysztof R. Apt,et al.  On the Safe Termination of PROLOG Programs , 1989, ICLP.

[19]  Maurice Bruynooghe,et al.  A Systematic Construction of Abstract Domains , 1994, SAS.

[20]  Shan-Hwei Nienhuys-Cheng,et al.  Completeness and Properness of Refinement Operators in Inductive Logic Programming , 1998, J. Log. Program..

[21]  Konstantinos Sagonas,et al.  XSB as an efficient deductive database engine , 1994, SIGMOD '94.

[22]  Hisao Tamaki,et al.  OLD Resolution with Tabulation , 1986, ICLP.

[23]  Prateek Mishra,et al.  Towards a Theory of Types in Prolog , 1984, SLP.

[24]  Nicolas Peltier,et al.  A New Method for Automated Finite Model Building Exploiting Failures and Symmetries , 1998, J. Log. Comput..

[25]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[26]  Bart Demoen,et al.  Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop , 1994, SAS.

[27]  Andreas Podelski,et al.  Directional Type Inference for Logic Programs , 1998, SAS.

[28]  Danny De Schreye,et al.  Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..

[29]  Maurice Bruynooghe,et al.  Solving Combinatorial Search Problems by Intelligent Backtracking , 1981, Inf. Process. Lett..

[30]  Krzysztof R. Apt,et al.  An Analysis of Loop Checking Mechanisms for Logic Programs , 1991, Theor. Comput. Sci..

[31]  Maurice Bruynooghe,et al.  Abstracting s-semantincs Using A Model-Theoretic Approach , 1994, PLILP.

[32]  Danny De Schreye,et al.  A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration , 1996, JICSLP.