Belief structures, possibility theory and decomposable confidence measures on finite sets
Computers and Artificial Intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
General theory of cumulative inference
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Theoretical foundations for non-monotonic reasoning in expert systems
Logics and models of concurrent systems
Epistemic entrenchment and possibilistic logic
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
On the specificity of a possibility distribution
Fuzzy Sets and Systems
Possibilistic assumption based truth maintenance system, validation in a data fusion application
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Nonmonotonic inference based on expectations
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Nonmonotonic reasoning, conditional objects and possibility theory
Artificial Intelligence
Fuzzy sets as a basis for a theory of possibility
Fuzzy Sets and Systems
IEEE Transactions on Knowledge and Data Engineering
ECAI '90 Workshop on Truth Maintenance Systems
Handling Hard Rules and Default Rules in Possibilistic Logic
IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Inheritance comes of age: applying nonmonotonic techniques to problems in industry
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Qualitative relevance and independence: a roadmap
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Coping with the limitations of rational inference in the framework of possibility theory
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
The Possibilistic Handling of Irrelevance in Exception-Tolerant Reasoning
Annals of Mathematics and Artificial Intelligence
Towards a Possibilistic Logic Handling of Preferences
Applied Intelligence
Violation Contexts and Deontic Independence
CONTEXT '99 Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Context
Confidence Relations as a Basis for Uncertainty Modeling, Plausible Reasoning, and Belief Revision
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Handling uncertainty and defeasibility in a possibilistic logic setting
International Journal of Approximate Reasoning
Bridging possibilistic conditional knowledge bases and partially ordered bases
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
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
Towards a logic of argumentation
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Preferential Semantics for Plausible Subsumption in Possibility Theory
Minds and Machines
Interpolative reasoning with default rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Using possibilistic logic for modeling qualitative decision: Answer Set Programming algorithms
International Journal of Approximate Reasoning
Hi-index | 0.00 |
This paper provides a survey of possibilistic logic as a simple andefficient tool for handling nonmonotonic reasoning, with some emphasis onalgorithmic issues. In our previous works, two well-known nonmonotonic systems have been encoded in the possibility theory framework: the preferential inference based on System P, and the rational closure inference proposed by Lehmann and Magidor which relies on System P augmented with a rational monotony postulate. System P is known to providereasonable but very cautious conclusions, and in particular, preferentialinference is blocked by the presence of “irrelevant” properties. When using Lehmann‘s rational closure, the inference machinery, which is then more productive, may still remain too cautious, or on the contrary, provide counter -intuitive conclusions. The paper proposes an approach to overcome the cautiousness of System P and the problems encountered by the rational closure inference. This approach takes advantage of (contextual) independence assumptions of the form: the fact that γ is true (or is false) does not affect the validity of the rule“normally if α then β”. The modelling of suchindependence assumptions is discussed in the possibilistic framework.Moreover, we show that when a counter-intuitive conclusion of a set ofdefaults can be inferred, it is always possible to repair the set ofdefaults by adding suitable information so as to produce the desiredconclusions and block unsuitable ones.