Abstract
The notion of the rational closure of a positive knowledge base K of conditional assertions θ\(i\) |∼ φ\(i\) (standing for if θ\(i\) then normally φ\(i\)) was first introduced by Lehmann (1989) and developed by Lehmann and Magidor (1992). Following those authors we would also argue that the rational closure is, in a strong sense, the minimal information, or simplest, rational consequence relation satisfying K. In practice, however, one might expect a knowledge base to consist not just of positive conditional assertions, θ\(i\) |∼ φ\(i\), but also negative conditional assertions, θi φ\(i\) (standing for not if θ\(i\) then normally φ\(i\). Restricting ourselves to a finite language we show that the rational closure still exists for satisfiable knowledge bases containing both positive and negative conditional assertions and has similar properties to those exhibited in Lehmann and Magidor (1992). In particular an algorithm in Lehmann and Magidor (1992) which constructs the rational closure can be adapted to this case and yields, in turn, completeness theorems for the conditional assertions entailed by such a mixed knowledge base.
Similar content being viewed by others
References
Delgrande, J.P., 1987, “A first-order logic for prototypical properties,” Artificial Intelligence 33, 105–130.
Delgrande, J.P., 1988, “An approach to default reasoning based on a first-order conditional logic: Revised report,” Artificial Intelligence 36, 63–90.
Gabbay, D.M., 1985, “Theoretical foundations for non-monotonic reasoning in expert systems,” pp. 439–457 in Proceedings NATO Advanced Institute on Logics and Models of Concurrent Systems, K.R. Apt, ed., Berlin: Springer-Verlag.
Gärdenfors, P., 1988, Knowledge in Flux, Cambridge, MA: MIT Press.
Kraus, S., Lehmann, D., and Magidor, M., 1990, “Nonmonotonic reasoning, preferential models and cumulative logics,” Artificial Intelligence 44, 167–207.
Lehmann, D., 1989, “What does a conditional knowledge base entail?,” in Proceedings First International Conference on Principles of Knowledge Representation and Reasoning, R. Brachman and H.J. Levesque, eds., Toronto, Ontario.
Lehmann, D. and Magidor, M., 1992, “What does a conditional knowledge base entail?,” Artificial Intelligence 55, 1–60.
Lehmann, D. and Magidor, M., 1994, “Erratum, What does a conditional knowledge base entail?,” Artificial Intelligence 68, 411.
Makinson, D., 1988, “General theory of cumulative inference,” pp. 1–18 in Proceedings Second International Workshop on Non-Monotonic Reasoning, M. Reinfrank, J. de Kleer, M.L. Ginsberg, and E. Sandewall, eds., Springer Lecture Notes in Artificial Intelligence, Volume 346, Berlin: Springer-Verlag.
McCarthy, J., 1980, “Circumscription: A form of non-monotonic reasoning,” Artificial Intelligence 13, 27–39.
McDermott, D. and Doyle, J., 1980, “Non-monotonic logic I,” Artificial Intelligence 13, 41–72.
Moore, R.C., 1984, “Possible-world semantics for autoepistemic logic,” pp. 369–401 in Proceedings Workshop on Non-Monotonic Reasoning, New Paltz, NY.
Pearl, J., 1988, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Palo Alto, CA: Morgan Kaufmann.
Reiter, R., 1980, “A logic of default reasoning,” Artificial Intelligence 13, 81–132.
Shoham, Y., 1987, “A semantical approach to nonmonotonic logics,” pp. 275–279 in Proceedings Logics in Computer Science, Ithaca, NY.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Booth, R., Paris, J. A Note on the Rational Closure of Knowledge Bases with Both Positive and Negative Knowledge. Journal of Logic, Language and Information 7, 165–190 (1998). https://doi.org/10.1023/A:1008261123028
Issue Date:
DOI: https://doi.org/10.1023/A:1008261123028