Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction

Authors:
Roberto Confalonieri;Juan Carlos Nieves;Javier Vázquez-Salceda
Affiliations:
Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona E - 08034;Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona E - 08034;Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona E - 08034
Venue:
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Year:
2009

Citing 4
Cited 4

Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Possibilistic uncertainty handling for answer set programming

Annals of Mathematics and Artificial Intelligence
Logical Weak Completions of Paraconsistent Logics

Journal of Logic and Computation

Weak and strong disjunction in possibilistic ASP

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Possibilistic semantics for logic programs with ordered disjunction

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Dealing with explicit preferences and uncertainty in answer set programming

Annals of Mathematics and Artificial Intelligence
Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.