TY - GEN
A1 - Fichte, Johannes K.
A1 - Truszczynski, Miroslaw
A1 - Woltran, Stefan
T1 - Dual-normal logic programs
BT - the forgotten class
T2 - Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
N2 - Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.
T3 - Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe - 585
KW - answer set programming
KW - classes of logic programs
KW - strong and uniform equivalence
KW - propositional satisfiability
Y1 - 2019
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-414490
SN - 1866-8372
IS - 585
ER -