Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
| dc.creator | Pelov, Nikolay | |
| dc.creator | Bruynooghe, Maurice | |
| dc.date | 2000-03-20 | |
| dc.date.accessioned | 2026-07-07T03:16:06Z | |
| dc.date.available | 2026-07-07T03:16:06Z | |
| dc.description | 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. | |
| dc.description | 18 pages, 1 figure, 3 tables presented at LPAR'99, Tbilisi, Georgia | |
| dc.identifier | https://arxiv.org/abs/cs/0003069 | |
| dc.identifier | http://arxiv.org/abs/cs/0003069 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30227 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.3.1; I.2.3 | |
| dc.title | Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog | |
| dc.type | text |