Abstract
Links between preferential semantics of possibilistic logic, semantics of prioritized circumscription, and one of the semantics used in logic programming, namely the perfect model semantics of stratified logic programs, are presented.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt, H. Blair, A. Walker, Towards a Theory of Declarative knowledge, in: Foundation of Deductive Databases and Logic Programming, (ed. J. Minker) Morgan Kaufmann, 89–148.
S. Benferhat, D. Dubois, H. Prade, Representing default rules in possibilistic logic. KR'92, 673–684.
Minimal subsumes default logic and circumscription in stratified logic programming, In LICS, New-York, 89–97.
D.Dubois,J.Lang, H.Prade. Automated reasoning using possibilistic logic: semantics, belief revision, and variable certainty weights. UIA'89, 81–87.
D. Dubois, J. Lang, H. Prade. Towards possibilistic logic programming. ICLP'91, 581–595.
D. Dubois, J. Lang, H. Prade. “Possibilistic logic”. To appear in Handbook of Logic for Artificial Intelligence (D.M. Gabbay, ed.), vol. 3, 439–513.
Non-monotonic inference based on expectations. Artificial Intelligence, to appear.
System-Z+: a formalism for reasoning with variable-strength defaults. AAAI-91, 399–404.
S. Kraus, D. Lehmann, M. Magidor. Non-monotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44: 167–207.
Computing Circumscription, IJCAI'85, Los-Angeles.
Foundations of Logic Programming. Springer-Verlag 1984.
Circumscription — A form of non-monotonic reasoning. Artificial Intelligence, 13:27–39.
Application of circumscription to formalize commonsense reasoning. Artificial Intelligence, 28:89–116.
System Z: A natural ordering of defaults with tractable applications to default reasoning. TARK'90, 121–135.
On the relationship between Logic programming and Non-monotonic Reasoning. AAAI'88, 444–448.
Reasoning About Change — Time and Causation from the Standpoint of Artificial Intelligence. Cambridge, Mass.: The MIT Press.
Mechanical proof procedures for many-valued lattice-based logic programming. Research report, Computer Science Dept., Syracuse Univ., N. Y., USA.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benferhat, S., Dubois, D., Prade, H. (1993). Possibilistic logic: From nonmonotonicity to logic programming. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028177
Download citation
DOI: https://doi.org/10.1007/BFb0028177
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57395-1
Online ISBN: 978-3-540-48130-0
eBook Packages: Springer Book Archive