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 co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...