On the complexity of identifying Head Elementary Set Free programs

Details On the complexity of identifying Head Elementary Set Free programs On the complexity of identifying Head Elementary Set Free programs

2009-05-25

arxiv.org/abs/0905.3802v1

Computer Science

Logic in Computer Science

11 pages. To appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the complexity of identifying Head Elementary Set Free programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of identifying Head Elementary Set Free programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of identifying Head Elementary Set Free programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-293664