A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
Theory and Practice of Logic Programming
AbstractEquilibrium logic is an approach to non-monotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case ofnested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kinds of theories. In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs intoquantified propositional logic, andoi:10.1017/s147106840999010x fatcat:4qwun6nfb5ctdpxdmnnulw5nmu