3 papers
cs.AI2000
Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison
Nikolay Pelov, Emmanuel De Mot, Marc Denecker
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solu…
cs.LO2000
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…
cs.LO2000
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…