Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog

Details Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog

2000-03-20

arxiv.org/abs/cs/0003069v1

Computer Science

Logic in Computer Science

18 pages, 1 figure, 3 tables presented at LPAR'99, Tbilisi, Georgia

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392476