Detecting unsolvable queries for definite logic programs
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 118-133
- https://doi.org/10.1007/bfb0056611
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- SLDNFA: An abductive procedure for abductive logic programsThe Journal of Logic Programming, 1998
- Directional Type Inference for Logic ProgramsPublished by Springer Nature ,1998
- An extended variant of atoms loop check for positive logic programsNew Generation Computing, 1997
- Analyzing logic programs using “prop”-ositional logic programs and a magic wandThe Journal of Logic Programming, 1995
- XSB as an efficient deductive database enginePublished by Association for Computing Machinery (ACM) ,1994
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- On rewrite programs: Semantics and relationship with prologThe Journal of Logic Programming, 1992
- Memoing for logic programsCommunications of the ACM, 1992
- An analysis of loop checking mechanisms for logic programsTheoretical Computer Science, 1991