In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
We present a new answer set solver, called nomore++, along with its underlying theoretical foundations. A distinguishing feature is that it treats heads and bodies equitably as com...
Christian Anger, Martin Gebser, Thomas Linke, Andr...
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...