This article surveys various complexity and expressiveness results on different forms of logic
programming. The main focus is on decidable forms of logic programming, in particular …

Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge
representation and reasoning, which is very expressive in a precise mathematical sense: it …

This paper surveys various complexity results on different forms of logic programming. The
main focus is on decidable forms of logic programming, in particular propositional logic …

Trust management (TM) is a promising approach for authorization and access control in
distributed systems, based on signed distributed policy statements expressed in a policy …

ASP solvers address several reasoning tasks that go beyond the mere computation of
answer sets. Among them are cautious reasoning, for modeling query entailment, and …

Logic programs with ordered disjunction (LPODs) contain a new connective which allows
representing alternative, ranked options for problem solutions in the heads of rules: A× B …

A relational database is inconsistent if it does not satisfy a given set of integrity constraints.
Nevertheless, it is likely that most of the data in it is consistent with the constraints. In this …

In this chapter, we summarize the research on querying inconsistent databases that we have
been conducting during the last five years. The formal framework that we have used is …

A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent
Query Answering (CQA) is the problem of computing from D the answers to a query that are …

We introduce the concept of weighted rules under the stable model semantics following the
log-linear models of Markov Logic. This provides versatile methods to overcome the …