34 citations · 60 across the 4 of their papers we have counts for
5 papers · 1 filter
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…
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 note on the Declarative reading(s) of Logic Programming
Marc Denecker
This paper analyses the declarative readings of logic programming. Logic programming - and negation as failure - has no unique declarative reading. One common view is that logic pr…
Problem solving in ID-logic with aggregates: some experiments
Bert Van Nuffelen, Marc Denecker
The goal of the LP+ project at the K.U.Leuven is to design an expressive logic, suitable for declarative knowledge representation, and to develop intelligent systems based on Logic…
Uniform semantic treatment of default and autoepistemic logics
Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic. For each logic we develop a comprehensive seman…