Detecting unsolvable queries for definite logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1490, Issue , 1998, Pages 118-133

  Bruynooghe, Maurice ^a   Vandecasteele, Henk ^a   de Waal, da Andre ^b   Denecker, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b NORTH WEST UNIVERSITY   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

GOAL-DIRECTEDNESS; LOGIC PROGRAMS; PLANNING PROBLEM;

LOGIC PROGRAMMING;

EID: 84947800948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056611     Document Type: Conference Paper

References (21)

1. H. Ade and M. Denecker. Abductive inductive logic programming. In Proc. IJ-CAI’95, pages 201-1209. Morgan Kaufman, 1995.
2. K. R. Apt, R. N. Bol, and J. W. Klop. On the safe termination of Prolog programs. In Proc. ICLP’89, pages 353-368, Lisbon, june 1989. MIT Press.
3. R. N. Bol, K. R. Apt, and J. W. Klop. An analysis of loop checking mechanisms for logic programs. Theoretical Computer Science, 86(l):35-79, august 1991.
4. M. P. Bonacina and J. Hsiang. On rewrite programs: semantics and relationship with Prolog. J. Logic Programming, 14(1&2):155-180, october 1992.
5. W. Charatonik and A. Podelski. Directional type inference for logic programs. In Proc. SAS’98, LNCS, Pisa, Italy, 1998. To appear.
6. M. Codish and B. Demoen. Analysing logic programs using "prop"-ositional logic programs and a magic wand. J. Logic Programming, 25(3):249-274, December 1995.
7. D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. J. Logic Programming, 19 & 20:199-260, may/july 1994.
8. D. A. de Waal, M. Denecker, M. Bruynooghe, and M. Thielscher. The generation of pre-interpretations for detecting unsolvable planning problems. In Proc. IJCAI Workshop on Model based Automated reasoning, pages 103-112, 1997.
9. M. Denecker and D. De Schreye. SLDNFA: an abductive procedure for abductive logic programs. J. Logic Programming, 34(2):201-226, Februari 1998.
10. J. Gallagher, D. Boulanger, and H. Sağlam. Practical model-based static analysis for definite logic programs. In Proc. ILPS’95, pages 351-365, Portland, Oregon, December 1995. MIT Press.
11. J. P. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs,. In Proc. ICLP94, pages 599-613. MIT Press, 1994.
12. N. Heintze. Set based program analysis. PhD thesis, School of Computer Science, Carnegie Mellon University, 1992.
13. Michael Leuschel, Danny De Schreye, and André de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In Proc. JICSLP’96, pages 319-332, Bonn, Germany, September 1996. MIT Press.
14. K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proc. SIGMOD 1994 Conf. ACM. Acm Press, 1994.
15. Y. D. Shen. An extended variant of atoms loop check for positive logic programs. New Generation Computing, 15(2):187-203, 1997.
16. J. Slaney. Finder: Finite domain enumerator system description. Technical Report TR-ARP-2-94, Centre for Information Science Research, Australian National University, Australia, 1994. Also in Proc. CADE-12.
17. J. Slaney. Finder-finite domain enumerator-version 3. 0-notes and guide. Technical report, Centre for Information Science Research, Australian National University, Australia, 1997.
18. Swedish Institute of Computer Science. SICSTUS Prolog User’s Manual, november 1997.
19. H. Tamaki and T. Sato. OLD resolution with tabulation. In Proceedings ICLP’86, LNCS, pages 84-98, London, 1986. Springer-Verlag.
20. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, 1989.
21. David S. Warren. Memoing for Logic Programs. Communications of the ACM, 35(3):93-lll, March 1992.