Abstract
Plausibility Logic was introduced by Daniel Lehmann. We show—among some other results—completeness of a subset of Plausibility Logic for Preferential Models, and incompleteness of full Plausibility Logic for smooth Preferential Models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boutilier, C., 1990a, “Conditional Logics of Normality as Modal Systems”, AAAI 1990, Boston, p. 594.
Boutilier, C., 1990b, “Viewing Conditional Logics of Normality as Extensions of the Modal System S4”, Toronto University, KRR-TR-90-4, June 1990.
Boutilier, C., 1992, “Conditional Logics for Default Reasoning and Belief Revision”, Dept. of Comp. Sc., Univ. Brit. Columbia TR 92-1, Jan. 92, Vancouver, Canada.
Bossu, G. and Siegel, P., 1985, “Saturation, Nonmonotonic Reasoning and the Closed-World Assumption”, Artificial Intelligence 25, 13–63.
Gabbay, D. M., 1985, “Theoretical foundations for non-monotonic reasoning in expert systems”, Logics and Models of Concurrent Systems, K. R. Apt, ed., Berlin: Springer-Verlag, p. 439–457.
Hansson, B., 1969, “An analysis of some deontic logics”, Nous 3, 373–398. Reprinted in R. Hilpinen, ed., Deontic Logic: Introductory and Systematic Readings, Reidel, Dordrecht, 1971, pp. 121–147.
Kraus, S., Lehmann, D., and Magidor, M., 1990, “Nonmonotonic reasoning, preferential models and cumulative logics”, Artificial Intelligence 44, 167–207.
Lehmann, D., 1992a. “Plausibility Logic”, Proceedings CSL91.
Lehmann, D., 1992b, “Plausibility Logic”, Tech.Rept. TR-92–3, Feb. 1992, Hebrew University, Jerusalem 91904, Israel.
Lehmann, D. and Magidor, M., 1992, “What does a conditional knowledge base entail?”, Artificial Intelligence 55, 1–60.
Makinson, D., 1993, “Five Faces of Minimality”, Studia Logica 52, 339–379.
Makinson, D., 1994, “General patterns in nonmonotonic reasoning”, in Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. III: ‘Nonmonotonic and Uncertain Reasoning’, D. Gabbay, C. Hogger, and Robinson, eds., Oxford University Press, pp. 35–110.
Schlechta, K., 1992, “Some Results on Classical Preferential Models”, Journal of Logic and Computation 2, 675–686.
Schlechta, K., 1994, “A Two-Stage Approach to First Order Default Reasoning”, to appear in Fundamenta Informaticae.
Schlechta, K., 1995, “Preferential Choice Representation Theorems for Branching Time Structures”, Journal of Logic and Computation 5, 783–800.
Schlechta, K., 1996, “Some Completeness Results for Stoppered and Ranked Classical Preferential Models”, Journal of Logic and Computation 6, 1–24.
Shoham, Y., 1987, “A semantical approach to nonmonotonic logics”, in Proc. Logics in Computer Science, pp. 275–279, Ithaca, N.Y.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schlechta, K. Completeness and incompleteness for plausibility logic. J Logic Lang Inf 5, 177–192 (1996). https://doi.org/10.1007/BF00173699
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00173699