A conceptualization of preferences in non-monotonic proof theory
Formalizing non-monotonic reasoning is a significant problem within artificial intelligence. A number of approaches have been proposed, but a clear understanding of the problem remains elusive. Given the diversity of proof theoretic approaches, we argue the need for frameworks for elucidating key concepts within non-monotonic reasoning. In this paper we consider the preferences, implicit and explicit, that can be seen in a disparate range of non-monotonic logics. In particular, we argue the case for an analysis based on Labelled Deductive Systems for viewing existing approaches to formalizing non-monotonic reasoning, and for identifying new approaches. For this we introduce the family of prioritized logics — each member being a defeasible logic defined in terms of labelled deduction -that forms the basis of a framework for viewing the nature and mechanization of non-monotonic reasoning.
KeywordsNon-monotonic logics Labelled Deductive Systems
Unable to display preview. Download preview PDF.
- Brewka G (1989) Preferred subtheories: An extended logical framework for default reasoning, IJCAI'89, Morgan KaufmannGoogle Scholar
- Cussens J & Hunter A (1991) Using defeasible logic for a window on a probabilistic database: Some preliminary notes, Proceedings of European Conference on Symbolic and Quantitaive Approaches to Uncertainty, LNCS 548, SpringerGoogle Scholar
- Froidevaux C & Grossetete C (1990) Graded default theories for uncertainty, Proceedings ECAI'90, PitmanGoogle Scholar
- Gabbay D (1985) Theoretical foundations for non-monotonic reasoning in expert systems, in Apt K, Logics and Models of Concurrent Systems, LNCS, SpringerGoogle Scholar
- Gabbay D (1991a) Labelled Deductive Systems: A position paper, in proceedings of Logic Colloquium 90, Lecture Notes in Logic 1, SpringerGoogle Scholar
- Gabbay D (1991b) Labelled deductive systems, Technical report, Centrum fur Informations und Sprachverarbeitung, Universitat MunchenGoogle Scholar
- Hunter A (1991) Use of priorities in non-monotonic proof theory, Technical report, Department of Computing, Imperial College, LondonGoogle Scholar
- Hunter A (1992) Labels theory for prioritized logics, Technical report, Department of Computing, Imperial College, LondonGoogle Scholar
- Laenens E & Vermier D (1990) A fixpoint semantics for ordered logic, J Logic & Computation, 1, 159–185Google Scholar
- Loui R (1986) Defeat amongst arguments: a system of defeasible inference, Technical report No 130, Department of Computer Science, University of Rochester, New YorkGoogle Scholar
- Makinson D (1989) A general theory of cumulative inference, in Reinfrank M, Proceedings of Second International Workshop on Non-monotonic Logic, LNCS 346, SpringerGoogle Scholar
- Reiter R (1978) On the closed-world databases, in Gallaire H & Minker J, Logic and Databases, Plenum PressGoogle Scholar