A proof theory for Constructive Default Logic
In earlier papers we developed a constructive version of Reiter's default logic; Constructive Default Logic (CDL) which is a default logic in which the fixed-point definition of extensions is replaced by a constructive definition. Constructive extensions have a computational advantage over Reiter's extensions. Reiter's default logic lacks a default proof theory for non-normal default rules, which was already observed by Reiter himself to be a weakness of his logic. In this paper we show that CDL does have a default proof theory.
KeywordsSelection Function Proof Theory Default Rule Default Theory Default Logic
Unable to display preview. Download preview PDF.
- 1.C. Froidevaux and J. Mengin, A framework for comparing default logics, Tech. Report LRI, Universite Paris Sud, 1992. (extended abstract appeared in Proceedings of the JELIA 92, Berlin, 1992.)Google Scholar
- 2.R.A. Gueirrero, M.A. Cassanova and A.S. Hemerly, Contributions to a proof theory for generic defaults, Proc. ECAI 90, 1990.Google Scholar
- 3.W. Lukaszewicz, Considerations on default logic — An alternative approach, Computational Intelligence, 4:1–16, 1988.Google Scholar
- 4.R. Reiter, A logic for default reasoning, Artificial Intelligence 13, pp. 81–132.Google Scholar
- 5.Y.H. Tan, BMS — A meta-level approach to non-monotonic reasoning, in: W. Van der Hoek, J.-J. Ch. Meyer, Y.H. Tan and C. Witteveen (eds.), Non-Monotonic Reasoning and Partial Semantics, Series in Artificial Intelligence, Ellis Horwood Publishers, 1992.Google Scholar
- 6.Y.H. Tan, A proof theory for constructive default logic, Tech. Report, Dept. of Computer Science, Erasmus University Rotterdam, Rotterdam, May 1993.Google Scholar
- 7.Y.H. Tan, J. Treur, Constructive default logic and the control of defeasible reasoning, In: B. Neumann (ed.), Proc. of the European Conference on Artificial Intelligence, ECAI '92, John Wiley and Sons, 1992, pp. 299–303.Google Scholar