Abstract
In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. Moreover being closer to possibilistic inference it allows to extend the necessity-values of the clauses to be considered, causing a higher level of comparison at the moment of selecting preferred pstable models of a possibilistic ordered disjunction programs. We compare the possibilistic pstable semantics for ordered disjunction programs with the recently defined possibilistic answer set semantics for the same class of logic programs. © Springer-Verlag 2009.
Cite
CITATION STYLE
Confalonieri, R., Nieves, J. C., & Vázquez-Salceda, J. (2009). Pstable semantics for logic programs with possibilistic ordered disjunction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5883 LNAI, pp. 52–61). https://doi.org/10.1007/978-3-642-10291-2_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
