TY - GEN
T1 - Head-elementary-set-free logic programs
AU - Gebser, Martin
AU - Lee, Joohyung
AU - Lierler, Yuliya
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program can be characterized by the loop formulas of its elementary sets. Based on the notion of an elementary set, we propose the notion of head-elementary-set-free (HEF) programs, a more general class of disjunctive programs than head-cycle-free (HCF) programs proposed by Ben-Eliyahu and Dechter, that can still be turned into nondisjunctive programs in polynomial time and space by "shifting" the head atoms into the body. We show several properties of HEF programs that generalize earlier results on HCF programs. Given an HEF program, we provide an algorithm for finding an elementary set whose loop formula is not satisfied, which has a potential for improving stable model computation by answer set solvers.
AB - The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program can be characterized by the loop formulas of its elementary sets. Based on the notion of an elementary set, we propose the notion of head-elementary-set-free (HEF) programs, a more general class of disjunctive programs than head-cycle-free (HCF) programs proposed by Ben-Eliyahu and Dechter, that can still be turned into nondisjunctive programs in polynomial time and space by "shifting" the head atoms into the body. We show several properties of HEF programs that generalize earlier results on HCF programs. Given an HEF program, we provide an algorithm for finding an elementary set whose loop formula is not satisfied, which has a potential for improving stable model computation by answer set solvers.
UR - http://www.scopus.com/inward/record.url?scp=38049067614&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38049067614&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-72200-7_14
DO - 10.1007/978-3-540-72200-7_14
M3 - Conference contribution
AN - SCOPUS:38049067614
SN - 9783540721994
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 149
EP - 161
BT - Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings
PB - Springer Verlag
T2 - 9th International Conference on Logic Programming and Nonmonotomic Reasoning, LPNMR 2007
Y2 - 15 May 2007 through 17 May 2007
ER -