On the complexity of identifying Head Elementary Set Free programs
Logic in Computer Science
2009-05-26 v1 Computational Complexity
Abstract
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.
Cite
@article{arxiv.0905.3802,
title = {On the complexity of identifying Head Elementary Set Free programs},
author = {Fabio Fassetti and Luigi Palopoli},
journal= {arXiv preprint arXiv:0905.3802},
year = {2009}
}
Comments
11 pages. To appear in Theory and Practice of Logic Programming (TPLP)