We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...