Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
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...
In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set p...
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...