Defaults in Domain Theory

Abstract This paper uses ideas from artificial intelligence to show how default notions can be defined over Scott domains. We combine these ideas with ideas arising in domain theory to shed some light on the properties of nonmonotonicity in a general model-theoretic setting. We consider in particular a notion of default nonmonotonic entailment between prime open sets in the Scott topology of a domain. We investigate in what ways this notion obeys the so-called laws of cautious monotony and cautious cut , proposed by Gabbay, Kraus, Lehmann, and Magidor. Our notion of nonmonotonic entailment does not necessarily satisfy cautious monotony, but does satisfy cautious cut. In fact, we show that any reasonable notion of nonmonotonic entailment on prime opens over a Scott domain, satisfying in particular the law of cautious cut, can be concretely represented using our notion of default entailment. We also give a variety of sufficient conditions for defaults to induce cumulative entailments, those satisfying cautious monotony. In particular, we show that defaults with unique extensions are a representation of cumulative nonmonotonic entailment. Furthermore, a simple characterization is given for those default sets which determine unique extensions in coherent domains. Finally, a characterization is given for Scott domains in which default entailment must be cumulative. This is the class of daisy domains ; it is shown to be cartesian closed, a purely domain-theoretic result.

[1]  Peter Gärdenfors,et al.  Nonmonotonic Inference Based on Expectations , 1994, Artif. Intell..

[2]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

[3]  Vladimir Lifschitz,et al.  On Open Defaults , 1990 .

[4]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[5]  Krzysztof R. Apt,et al.  Logics and Models of Concurrent Systems , 1989, NATO ASI Series.

[6]  K. Jon Barwise.  Information Links in Domain Theory , 1991, MFPS.

[7]  Cees Witteveen,et al.  Non-monotonic reasoning and partial semantics , 1992 .

[8]  Dov M. Gabbay,et al.  Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems , 1989, Logics and Models of Concurrent Systems.

[9]  M. de Rijke,et al.  Logic, Language and Computation , 1997 .

[10]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[11]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[12]  Guo-Qiang Zhang,et al.  Attunement to constraints in nonmonotonic reasoning , 1994 .

[13]  Guo-Qiang Zhang.  Logic of Domains , 1991, Progress in Theoretical Computer Science.

[14]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[15]  William C. Rounds,et al.  Nonmonotonic consequence in default model theory , 1994 .

[16]  Judea Pearl,et al.  From Adams' conditionals to default expressions, causal conditionals, and counterfactuals , 1994 .

[17]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[18]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[19]  Guo-Qiang Zhang,et al.  Domain Theory Meets Default Logic , 1995, J. Log. Comput..

[20]  J. McCarthy.  Circumscription|a Form of Nonmonotonic Reasoning , 1979 .

[21]  Guo-Qiang Zhang,et al.  Constraints in Nonmonotonic Reasoning , 1993, PPCP.