34 citations · 60 across the 4 of their papers we have counts for
10 papers
A Logic for Non-Monotone Inductive Definitions
Marc Denecker, Eugenia Ternovska
Well-known principles of induction include monotone induction and different sorts of non-monotone induction such as inflationary induction, induction over well-founded sets and ite…
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics
Joost Vennekens, David Gilis, Marc Denecker
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "leve…
Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning
Ofer Arieli, Marc Denecker, Bert Van Nuffelen +1
In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to `rep…
Ultimate approximations in nonmonotonic knowledge representation systems
Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sh…
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…