Zwar waren die Schrifttafeln, die in der Palastschule von Mari (Mesopotamien um 1800 v.
Chr.) gefunden wurden, der Funktion nach „Schulbücher “; doch im engeren Sinne beginnt …

Abstract In recent years, Answer Set Programming has gained popularity as a viable
paradigm for applications in knowledge representation and reasoning. This paper presents …

We present a new and general approach for defining, understanding, and computing logic
programming semantics. We consider disjunctive programs for generality, but our results are …

We present a framework for expressing bottom-up algorithms to compute the well-founded
model of non-disjunctive logic programs. Our method is based on the notion of conditional …

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 …

The paper describes a novel methodology to compute stable models in Answer Set
Programming. The proposed approach relies on a bottom-up computation that does not …

We present a bottom-up algorithm for the computation of the well-founded model of non-
disjunctive logic programs. Our method is based on the elementary program transformations …

There are many applications where the precise time at which an event wifi occur (or has
occurred) is uncertain. Temporal probabilistic logic programs (TPLPs) allow a programmer …

Tabling has become important to logic programming in part because it opens new
application areas, such as model checking, to logic programming techniques. However, the …

The well-founded semantics is one of the most widely studied and used semantics of logic
programs with negation. In the case of finite propositional programs, it can be computed in …