Representation results for default logics
Normal forms play an important role in computer science, for example in the areas of logic and databases. This paper provides a study of normal forms for some prominent logics for default reasoning. In particular we show that in Constrained and in Justified Default Logic, semi-normal default theories can represent arbitrary default theories. The main result for Justified Default Logic requires the signature (logical language to be enhanced in order to obtain the desired outcome.
Unable to display preview. Download preview PDF.
- G. Antoniou. Nonmonotonic Reasoning. MIT Press 1997 (in press)Google Scholar
- E.F. Codd. Further Normalization of the Data Base Relational Model. In Data Base Systems, Courant Computer Science Symposia Series 6, Prentice Hall 1972Google Scholar
- W. Lukaszewicz. Considerations of default logic: an alternative approach. Computational Intelligence 4,1 (1988): 1–16Google Scholar
- V. Marek and M. Truszczynski. Nonmonotonic Logic. Springer 1993Google Scholar
- A. Mikitiuk. Semi-representability of default theories in rational default logic. In the Proceedings of the 5th European Workshop on Logics in AI (JELIA'96) (in press)Google Scholar
- R. Reiter. A logic for default reasoning. Artificial Intelligence 13 (1980): 81–132Google Scholar
- T. Schaub. On Constrained Default Theories. In the Proceedings of the 10th European Conference on Artificial Intelligence, Wiley 1992, 304–308Google Scholar