Title of article
On the complexity of identifying head-elementary-set-free programs
Author/Authors
FABIO FASSETTI، نويسنده , , Luigi Palopoli، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
11
From page
113
To page
123
Abstract
Head-elementary-set-free (HEF) 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 HEF programs. This note solves the open problem by showing that the problem is complete for coNP.
Keywords
elementary set , disjunctive logic program , computational complexity , headelementary-set-free program
Journal title
theory and practice of logic programming
Serial Year
2010
Journal title
theory and practice of logic programming
Record number
660633
Link To Document