The well-founded semantics for general logic programs
Journal of the ACM (JACM)
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
Transformation-Based Bottom-Up Computation of the Well-Founded Model
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Possibilistic uncertainty handling for answer set programming
Annals of Mathematics and Artificial Intelligence
Semantics for possibilistic disjunctive programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Pstable semantics for possibilistic logic programs
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
A possibilistic intuitionistic logic
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
A Possibilistic Argumentation Decision Making Framework with Default Reasoning
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
| Hi-index | 0.00 |
Recently, a good set of logic programming semantics has been defined for capturing possibilistic logic program. Practically all of them follow a credulous reasoning approach. This means that given a possibilistic logic program one can infer a set of possibilistic models. However, sometimes it is desirable to associate just one possibilistic model to a given possibilistic logic program. One of the main implications of having just one model associated to a possibilistic logic program is that one can perform queries directly to a possibilistic program and answering these queries in accordance with this model. In this paper, we introduce an extension of the Well-Founded Semantics, which represents a sceptical reasoning approach, in order to capture possibilistic logic programs. We will show that our new semantics can be considered as an approximation of the possibilistic semantics based on the answer set semantics and the pstable semantic. A relevant feature of the introduced semantics is that it is polynomial time computable.