Abstract
Default domain theory is a framework for representing and reasoning about commonsense knowledge. Although this theory is motivated by ideas in Reiter’s work on default logic, it is in some sense a 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 representing partial information in the semantics of programming languages, is adopted as the basis for constructing partial models. This paper considers some of the laws of nonmonotonic consequence, due to Gabbay and to Kraus, Lehmann, and Magidor, in the light of default domain theory. We remark that in some cases Gabbay’s law of cautious monotony is open to question. We consider an axiomatization of the nonmonotonic consequence relation on prime open sets in the Scott topology – the natural logic – of a domain, which omits 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 extensions guarantees cautious monotony, and we give several classes of default structures which determine unique extensions.
Similar content being viewed by others
References
S. Abramsky and A. Jung, Domain theory, in: Handbook of Logic in Computer Science, Vol. 3, eds. S. Abramsky, D.M. Gabbay and T.S.E. Maibaum (Oxford Science Publications, 1995) pp. 1–168.
E. Adams, The Logic of Conditionals (D. Reidel, Netherlands, 1975).
J. Barwise, The Situation in Logic, Vol. 17 (Center for Study of Language and Information, Stanford, California, 1989).
P. Besnard, An Introduction to Default Logic (Springer-Verlag, 1989).
D. Gabbay, Theoretical foundations for nonmonotonic reasoning in expert systems, in: Proceedings of NATO Advanced Study Institute on Logics and Models of Concurrent Systems, ed. K.R. Apt (Springer-Verlag, 1985) pp. 439–457.
G. Gazdar, E. Klein, G. Pullum and I. Sag, Generalized Phrase Structure Grammar (Harvard University Press, 1985).
C. Gunter, Semantics of Programming Languages: Structures and Techniques (MIT Press, Boston, 1992).
J. Halpern and Y. Moses, A guide to modal logics of knowledge and belief, in: Proc. IJCAI '85 (1985) pp. 480–490.
R. Kasper and W. Rounds, The logic of unification in grammar, Linguistics and Philosophy 13 (1990) 33–58.
S. Kraus, D. Lehmann and M. Magidor, Nonmonotonic reasoning, preferential models, and cumulative logics, Artificial Intelligence 44 (1990) 167–207.
D. Lehmann, What does a conditional knowledge base entail?, in: Proceedings of KR '89 (Morgan-Kaufmann, 1989) pp. 212–234.
H.J. Levesque, All I know: A study in autoepistemic logic, Artificial Intelligence 42 (1990) 263–309.
D. Makinson, General patterns in nonmonotonic reasoning, in: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, eds. D.M. Gabbay, C.J. Hogger and J.A. Robinson (1994) pp. 35–110.
W. Marek, A. Nerode and J. Remmel, A theory of nonmonotonic rule systems, in: Proceedings of 5th IEEE Symposium on Logic in Computer Science (1990) pp. 79–94.
W. van der Hoek, J.J.Ch. Meyer, Y.H. Tan and C. Witteveen, eds., Non-Monotonic Reasoning and Partial Semantics (Ellis Horwood, 1992).
J. Pearl, From Adams' conditionals to default expressions, causal conditionals, and counterfactuals, in: Festschrift for Ernest Adams (Cambridge University Press) (to appear).
F. Pereira and D.H.D. Warren, Definite clause grammars for language analysis: A survey of the formalism and a comparison with augmented transition networks, Artificial Intelligence 13 (1980) 231–278.
R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81–132.
W. Rounds and G.-Q. Zhang, Domain theory meets default logic, Logic and Computation 5 (1995) 1–25.
D.S. Scott, Domains for denotational semantics, in: Lecture Notes in Computer Science 140 (1982) pp. 577–613.
S. Vickers, Topology via Logic (Cambridge University Press, 1989).
G. Winskel, The Formal Semantics of Programming Languages (MIT Press, Boston, 1992).
M. Young and W. Rounds, A logical semantics for nonmonotonic feature structures, in: Proc. ACL Symp. on Computational Linguistcs (1993) pp. 209–215.
G.-Q. Zhang, Logic of Domains (Birkhauser, Boston, 1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, G., Rounds, W.C. Nonmonotonic consequences in default domain theory. Annals of Mathematics and Artificial Intelligence 20, 227–265 (1997). https://doi.org/10.1023/A:1018988629376
Issue Date:
DOI: https://doi.org/10.1023/A:1018988629376