38 citations · 42 across the 3 of their papers we have counts for
3 papers · 2 filters
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
Nikolay Pelov, Maurice Bruynooghe
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…
Detecting Unsolvable Queries for Definite Logic Programs
Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal +1
In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachab…
A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems
Nikolay Pelov, Emmanuel De Mot, Maurice Bruynooghe
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there are definite programs and constraint logic programs t…