MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Nonmonotonic consequences in default model theory. The Third (1993) [1 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Guo-qiang Zhang, William C. Rounds
Bar-Ilan Symposium on the Foundations of Artificial Intelligence, Bar-Ilan
ftp://ftp.eecs.umich.edu/people/rounds/aimath93.ps.gz
Add To MetaCart

Abstract:

Abstract. Default model theory is a nonmonotonic formalism for representing and reasoning about commonsense knowledge. Although this theory is motivated by ideas in Reiter's work on default logic, it is a very different, in some sense dual framework. We make Reiter's default extension operator into a constructive method of building models, not theories. Domain theory, which is a well established tool for partial information in the semantics of programming languages, is adopted as the basis for constructing partial models. One of the direct advantages of default model theory is that nonmonotonic reasoning can be conducted with monotonic logics, by using the method of model checking, instead of theorem proving. This paper reconsiders some of the laws of nonmonotonic consequence, due to Gabbay and to Kraus, Lehmann, and Magidor, in the light of default model theory. We remark that in general, Gabbay's law of cautious monotony is open to question. We consider an axiomatization of the nonmonotonic consequence relation omitting this law. We prove a representation theorem showing that such relations are in one to one correspondence with the consequence relations determined by extensions in Scott domains augmented with default sets. This means that defaults are very expressive: they can, in a sense, represent any reasonable nonmonotonic entailment. Results about what kind of defaults determine cautious monotony are also discussed. In particular, we show that the property of unique extension guarantees cautious monotony, and we characterize default structures which determine unique extensions. 1

Citations

1177 A logic for default reasoning – Reiter - 1979
413 Nonmonotonic reasoning, preferential models and cumulative logics – Kraus, Lehmann, et al. - 1990
347 Domain theory – Abramsky, Jung - 1994
342 A logical framework for default reasoning – Poole - 1988
244 Domains for denotational semantics – Scott - 1982
240 Semantics of Programming Languages: Structures and Techniques. Foundations of Computing – Gunter - 1992
190 What does a conditional knowledge base entail – Lehmann - 1989
167 All I know: a study in autoepistemic logic – Levesque - 1990
165 The Formal Semantics of Programming Languages – Winskel - 1993
161 Theoretical foundations for non-monotonic reasoning in expert systems – Gabbay - 1985
109 The logic of conditionals – Adams - 1975
108 Model checking vs. theorem proving: A manifesto – Halpern, Vardi - 1991
107 General theory of cumulative inference – Makinson - 1989
93 Making believers out of computers – Levesque - 1986
77 Topology via logic – Vickers - 1989
74 A guide to the modal logic of knowledge and belief – Halpern, Moses - 1985
64 An Introduction to Default Logic – Besnard - 1989
56 Cumulative default logic: In defense of nonmonotonic inference rules – Brewka - 1991
40 Logic of Domains – ZHANG - 1991
38 On open defaults – Lifschitz - 1990
14 From Adams' conditionals to default expressions, causal conditionals, and counterfactuals – Pearl - 1993
10 The Situation in Logic. 17. Center for Study of Language and Information – Barwise - 1989
9 Domain theory meets default logic – Rounds, Zhang - 1995
8 Logical considerations on default semantics – Rounds, Zhang - 1994
6 An alternative semantics for default logic (preprint – Guerreiro, Casanova - 1990
1 and Guo-Qiang Zhang. Logics for default domains – Rounds - 1993