Disjunctive logic programs have become a powerful tool in knowledge representation and
commonsense reasoning. This paper focuses on stable model semantics, currently the most …

This article studies an implementation methodology for partial and disjunctive stable models
where partiality and disjunctions are unfolded from a logic program so that an …

At a workshop held in Toulouse, France in 1977, Gallaire, Minker and Nicolas stated that
logic and databases was a field in its own right (see [131]). This was the first time that this …

Assumption-Based Argumentation (ABA) has been shown to subsume various other non-
monotonic reasoning formalisms, among them normal logic programming (LP). We re …

In this overview we show how Knowledge Representation (KR) can be done with the help of
generalized logic programs. We start by introducing the core of PROLOG, which is based on …

Formal approaches that aim at representing human reasoning should be evaluated based
on how humans actually reason. One way of doing so is to investigate whether …

This paper presents a technique for the optimization of bound queries on disjunctive
deductive databases. The optimization is based on the rewriting of the source program into …

The Weak Completion Semantics is a novel cognitive theory which has been successfully
applied to the suppression task, the selection task, syllogistic reasoning, the belief bias …

This paper investigates two fixpoint approaches for minimal model reasoning with
disjunctive logic programs P. The first one, called model generation, is based on an operator …

In this paper, we continue to explore many-valued disjunctive logic programs with
probabilistic semantics. In particular, we newly introduce the least model state semantics for …