Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Towards a Possibilistic Logic Handling of Preferences
Applied Intelligence
Characterizations of the Stable Semantics by Partial Evaluation
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
Possibilistic uncertainty handling for answer set programming
Annals of Mathematics and Artificial Intelligence
Handling uncertainty and defeasibility in a possibilistic logic setting
International Journal of Approximate Reasoning
Probabilistic reasoning with answer sets
Theory and Practice of Logic Programming
Dealing Automatically with Exceptions by Introducing Specificity in ASP
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A Model Based on Possibilistic Certainty Levels for Incomplete Databases
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A comparative study of logic programs with preference
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Possibility theory as a basis for qualitative decision theory
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Weak nonmonotonic probabilistic logics
Artificial Intelligence
Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Pstable semantics for possibilistic logic programs
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Preferences in AI: An overview
Artificial Intelligence
Weight constraints with preferences in ASP
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Working with Preferences: Less Is More
Working with Preferences: Less Is More
Answer set programming for computing decisions under uncertainty
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Handling exceptions in logic programming without negation as failure
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Weak and strong disjunction in possibilistic ASP
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Hybrid probabilistic logic programs with non-monotonic negation
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Possibilistic semantics for logic programs with ordered disjunction
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Nested Preferences in Answer Set Programming
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Semantics for possibilistic disjunctive programs*
Theory and Practice of Logic Programming
Using possibilistic logic for modeling qualitative decision: Answer Set Programming algorithms
International Journal of Approximate Reasoning
Hi-index | 0.00 |
In this paper, we show how the formalism of Logic Programs with Ordered Disjunction (LPODs) and Possibilistic Answer Set Programming (PASP) can be merged into the single framework of Logic Programs with Possibilistic Ordered Disjunction (LPPODs). The LPPODs framework embeds in a unified way several aspects of common-sense reasoning, nonmonotonocity, preferences, and uncertainty, where each part is underpinned by a well established formalism. On one hand, from LPODs it inherits the distinctive feature of expressing context-dependent qualitative preferences among different alternatives (modeled as the atoms of a logic program). On the other hand, PASP allows for qualitative certainty statements about the rules themselves (modeled as necessity values according to possibilistic logic) to be captured. In this way, the LPPODs framework supports a reasoning which is nonmonotonic, preference- and uncertainty-aware. The LPPODs syntax allows for the specification of (1) preferences among the exceptions to default rules, and (2) necessity values about the certainty of program rules. As a result, preferences and uncertainty can be used to select the preferred uncertain default rules of an LPPOD and, consequently, to order its possibilistic answer sets. Furthermore, we describe the implementation of an ASP-based solver able to compute the LPPODs semantics.