Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...