论文信息 - On the complexity of identifying head-elementary-set-free programs

On the complexity of identifying head-elementary-set-free programs

Head-elementary-set-free programs were proposed in (Gebser et al. 2007) and shown to generalize over head-cycle-free programs while retaining their nice properties. It was left as an open problem in (Gebser et al. 2007) to establish the complexity of identifying head-elementary-set-free programs. This note solves the open problem, by showing that the problem is complete for co-NP.

Luigi Palopoli | Fabio Fassetti

[1] Luigi Palopoli,et al. Reasoning with Minimal Models: Efficient Algorithms and Applications , 1997, Artif. Intell..

[2] Yuliya Lierler,et al. Head-Elementary-Set-Free Logic Programs , 2007, LPNMR.

[3] Rina Dechter,et al. Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[4] Wolfgang Faber,et al. The DLV system for knowledge representation and reasoning , 2002, TOCL.

[5] Georg Gottlob,et al. Complexity and expressive power of logic programming , 2001, CSUR.

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Yuliya Lierler,et al. Elementary Sets of Logic Programs , 2006, AAAI.