2000/03/20 by Nikolay Pelov, Pelov, Nikolay, Maurice Bruynooghe +1
Computer Science · #Advanced Database Systems and Queries #F.3.1 #FOS: Computer and information sciences #I.2.3 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0003069
18 pages, 1 figure, 3 tables presented at LPAR'99, Tbilisi, Georgia
arxiv created 2000/03/20 · openalex publication_date 2000/03/20 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Proving failure of queries for definite logic programs can be done by constructing a finite model of the program in which the query is false. A general purpose model generator for first order logic can be used for this. A recent paper presented at PLILP98 shows how the peculiarities of definite programs can be exploited to obtain a better solution. There a procedure is described which combines abduction with tabulation and uses a meta-interpreter for heuristic control of the search. The current paper shows how similar results can be obtained by direct execution under the standard tabulation of the XSB-Prolog system. The loss of control is compensated for by better intelligent backtracking and more accurate failure analysis.