Abstract
After sketching the first and second order version of McCarthy's predicate circumscription, we introduce the notion of positive disjunctive circumscription as an approach to (this form of) non-monotonic reasoning which guarantees consistency. We define the positive disjunctive extension PD(T) of a first order theory T and show that it is conservative over T. Then we turn to sets defined by positive disjunctive circumscription and state a boundedness theorem concerning their stages. The last considerations refer to generalizations of positive disjunctive circumscription. We discuss the inclusion of (intersective) priority relations and extensions by iteration.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Buchholz, W., Feferman, S., Pohlers, W. and Sieg, W. Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies. Lecture Notes in Mathematics 897, Springer-Verlag, Berlin, Heidelberg, New York (1981).
Chang C.L. and Lee R.C.T. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973).
Clark, K. Negation as failure. In: Logic and Databases. Gallaire, H. and Minker, J. (eds.). Plenum Press, New York (1978).
Davis, M. The mathematics of non-monotonic reasoning. Artificial Intelligence 13 (1980).
Etherington, D.W., Mercer, R.E. and Reiter, R. On the adequacy of predicate circumscription for closed-world reasoning. Computational Intelligence 1 (1985).
Feferman, S. Monotone inductive definitions. In: The L.E.J. Brouwer Centenary Symposion. Troelstra, A.S. and van Dalen, D. (eds.). North Holland, Amsterdam (1982).
Jaeger, G. The proof-theoretic analysis of positive disjunctive circumscription. Preprint, Zuerich (1985).
Lifschitz, V. Computing circumscription. Proceedings IJCAI-85.
Lifschitz, V. Closed world data bases and circumscription. Preprint 1985.
Lifschitz, V. On the satisfiability of circumscription. Preprint 1986.
McCarthy, C. Circumscription — a form of non-monotonic reasoning. Artificial Intelligence 13 (1980).
McCarthy, C. Applications of circumscription to formalizing common sense knowledge. AAAI Workshop on Non-Monotonic Reasoning (1984).
McDermott, D. and Doyle, J. Non-monotonic logic I. Artificial Intelligence 13 (1980).
Moore, R.C. Semantical considerations on nonmonotonic logic. Artificial Intelligence 25 (1985).
Moschovakis, Y.N. Elementary Induction on Abstract Structures. North Holland, Amsterdam (1974).
Parikh, R. Logic of knowledge, games and dynamic logic. Lecture Notes in Computer Science 181. Springer-Verlag, Berlin, Heidelberg, New York, Tokyo (1984).
Reiter, R. On closed world data bases. In: Logic and Databases. Gallaire, H. and Minker J. (eds.). Plenum Press, New York (1978).
Reiter, R. Circumscription implies predicate completion (sometimes). Proceedings of the National Conference on Artificial Intelligence, AAAI-82.
Shoenfield, J.R. Mathematical Logic. Addison-Wesley, Reading, Mass. (1967).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaeger, G. (1986). Some contributions to the logical analysis of circumscription. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_88
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16780-8
Online ISBN: 978-3-540-39861-5
eBook Packages: Springer Book Archive