• DOI:10.1007/BF01530761
Corpus ID: 594147

Propositional semantics for disjunctive logic programs

@article{BenEliyahuZohary2005PropositionalSF,
  title={Propositional semantics for disjunctive logic programs},
  author={R. Ben-Eliyahu-Zohary and R. Dechter},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={2005},
  volume={12},
  pages={53-87}
}

R. Ben-Eliyahu-Zohary, R. Dechter

Published 2005

Mathematics, Computer Science

Annals of Mathematics and Artificial Intelligence

In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs. We show that any propositional HEDLP can be mapped in polynomial time into a propositional theory such that each model of the latter corresponds to an answer set, as defined by stable model semantics, of the former. Using this mapping, we show that many queries over HEDLPs can be determined by solving… CONTINUE READING

View on Springer

escholarship.org

Save to Library

Create Alert

Cite

Launch Research Feed