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

Answer set programming is a declarative programming paradigm rooted in logic
programming and non-monotonic reasoning. This formalism has become a host for …

Managing uncertainty and/or vagueness is starting to play an important role in Semantic
Web representation languages. Our aim is to overview basic concepts on representing …

Termination analysis is often performed over the abstract domains of monotonicity
constraints or of size change graphs. First, the transition relation for a given program is …

We describe the fields of disjunctive logic programming and disjunctive deductive databases
from the time of their inception to the current time. Contributions with respect to semantics …

Unlike monotone single-valued functions, multivalued mappings may have zero, one, or
(possibly infinitely) many minimal fixed-points. The contribution of this work is twofold. First …

All major semantics of normal logic programs and normal logic programs with aggregates
can be described as fixpoints of the one-step provability operator or of operators that can be …

The field of logic and databases is an outgrowth of work in logic programming and
databases. It is assumed that the reader is familiar with work in relational databases as …

Abstract linTAP is a tableau prover for the multiplicative and exponential fragment M? LL of
Girards linear logic. It proves the validity of a given formula by constructing an analytic …

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 …