activity
19992005
most citedA Logic for Non-Monotone Inductive Definitions

34 citations · 60 across the 4 of their papers we have counts for

collaborators
Showing cs.AIShow all

6 papers · 1 filter

cs.AI200534 cited

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…

cs.AI20047 cited

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…

cs.AI200216 cited

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…

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.AI2000

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…

cs.AI2000

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…