Guarded resolution for answer set programming
–arXiv.org Artificial Intelligence
We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result.
arXiv.org Artificial Intelligence
Feb-21-2010
- Country:
- Genre:
- Research Report (0.40)
- Technology: