Abstract
This paper extends results done jointly with Dubois and Prade [3] about reasoning with generic knowledge in a possibilistic setting. We propose an approach to reasoning with both hard and default rules. We mean by a hard rule, the complete information “if we observe φ then we conclude (certainly) ψ”, and by a default rule, the generic information “if we observe φ then generally we conclude ψ”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.W. Adams (1975). The Logic of Conditionals. Dordrecht: D. Reidel.
S. Benferhat (1994) Raisonnement non-monotone et traitement de l'inconsistance en logique possibiliste. Thèse de l'Université P. Sabatier, Toulouse.
S. Benferhat, D. Dubois, H. Prade (1992) Representing default rules in possibilistic logic. KR'92, 673–684.
S. Benferhat, C. Cayrol, D. Dubois, J. Lang, H. Prade (1993) Inconsistency management and prioritized syntax-based entailment. Proc. of IJCAI'93.
D. Dubois, J. Lang, H. Prade (1994). Possibilistic logic. To appear in Handbook of Logic for Artificial Intelligence (D.M. Gabbay, ed.), vol. 3, 439–513.
D.Dubois, H. Prade (1991) Possibilistic logic, preferential models, nonmonotonicity and related issues. IJCAI'91, 419–424.
D. Dubois, H. Prade.(1993) Conditional Objects as Non-monotonic Consequence Relationships. Technical report, IRIT-93-08-R (University of Toulouse).
L. Fariñas del Cerro, A. Herzig, and J. Lang (1992). From expectation-based nonmonotonic reasoning to conditional logics. Working Notes of the 4th Inter. Workshop on Nonmonotonic Reasoning, Plymouth, Vermont, May 28–31, 79–86.
M. Goldszmidt, et J. Pearl (1991). On the consistency of defeasible databases. Artificial Intelligence 52:121–149.
S. Kraus, D. Lehmann, and M. Magidor (1990). Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44:167–207.
P. Lamarre (1992), A Promenade from Monotonicity to Non-Monotonicity Following a Theorem Prover. Proc. of KR'92.
D. Lehmann (1989), What does a conditional knowledge base entail? Proc. KR'89, pages 357–367.
J. Pearl (1988), Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publ. Inc., San Mateo, Ca., 1988.
J. Pearl (1990). System Z: a natural ordering of defaults with tractable applications to default reasoning. Proc.TARK, 121–135.
R. Reiter (1980), A Logic for Default Reasoning; Artificial Intelligence N∘13, 81–132.
Y. Shoham, (1988), Reasoning About Change — Time and Causation from the Standpoint of Artificial Intelligence. Cambridge, Mass.: The MIT Press.
R. R. Yager (1993), On the completion of priority orderings in nonmonotonic reasoning” Technical Report #1216, Iona College.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benferhat, S. (1995). Handling hard rules and default rules in possibilistic logic. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Advances in Intelligent Computing — IPMU '94. IPMU 1994. Lecture Notes in Computer Science, vol 945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035963
Download citation
DOI: https://doi.org/10.1007/BFb0035963
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60116-6
Online ISBN: 978-3-540-49443-0
eBook Packages: Springer Book Archive