Marc Denecker
Professor at KU Leuven
In this paper we define and study a multi-agent extension of autoepistem...
Many practical problems can be understood as the search for a state of
a...
Our position is that logic programming is not programming in the Horn cl...
Justification theory is a general framework for the definition of semant...
The first phase of developing an intelligent system is the selection of ...
An important sign of intelligence is the capacity to apply a body of
kno...
Aggregates provide a concise way to express complex knowledge. While the...
Parity games are infinite two-player games played on directed graphs. Pa...
Justification theory is a unifying semantic framework. While it has its ...
In Knowledge Representation, it is crucial that knowledge engineers have...
Programming Computable Functions (PCF) is a simplified programming langu...
A large part of the use of knowledge base systems is the interpretation ...
Cause-effect relations are an important part of human knowledge. In real...
Grounding is the task of reducing a first-order theory and finite domain...
Previous research into the relation between ASP and classical logic has
...
The logic FO(ID) uses ideas from the field of logic programming to exten...
In this paper we present a proposal for a knowledge-based programming
en...
A fact apparently not observed earlier in the literature of nonmonotonic...
This papers develops a logical language for representing probabilistic c...
We study fixpoints of operators on lattices. To this end we introduce th...
In solving a query, the SLD proof procedure for definite programs someti...
This paper analyses the declarative readings of logic programming. Logic...
The goal of the LP+ project at the K.U.Leuven is to design an expressive...
The goal of this paper is to extend classical logic with a generalized n...
We revisit the issue of connections between two leading formalisms in
no...