Default-Reasoning with Models

Reasoning with model-based representations is an intuitive paradigm, which has been shown to be theoretically sound and to possess some computational advantages over reasoning with formula-based representations of knowledge. In this paper we present more evidence to the utility of such representations. In real life situations, one normally completes a lot of missing "context" information when answering queries. We model this situation by augmenting the available knowledge about the world with context-specific information; we show that reasoning with model-based representations can be done efficiently in the presence of varying context information. We then consider the task of default reasoning. We show that default reasoning is a generalization of reasoning within context, in which the reasoner has many "context" rules, which may be conflicting. We characterize the cases in which model-based reasoning supports efficient default reasoning and develop algorithms that handle efficiently fragments of Reiter's default logic. In particular, this includes cases in which performing the default reasoning task with the traditional, formula-based, representation is intractable. Further, we argue that these results support an incremental view of reasoning in a natural way.

[1]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

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

[3]  Bart Selman,et al.  Horn Approximations of Empirical Data , 1995, Artif. Intell..

[4]  Nader H. Bshouty,et al.  Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[5]  Dale Schuurmans,et al.  Learning Default Concepts , 1994 .

[6]  Dan Roth,et al.  Learning to reason , 1994, JACM.

[7]  P. Johnson-Laird Mental models , 1989 .

[8]  Raymond Reiter A theory of diagnosis from first principles , 1986 .

[9]  Hector J. Levesque,et al.  Abductive and Default Reasoning: A Computational Core , 1990, AAAI.

[10]  Heikki Mannila,et al.  Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..

[11]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[12]  Bart Selman,et al.  Hard Problems for Simple Default Logics , 1989, Artif. Intell..

[13]  Dan Roth,et al.  Reasoning with Models , 1994, Artif. Intell..

[14]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[15]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[16]  Dan Roth,et al.  Learning to Reason: The Non-Monotonic Case , 1995, IJCAI.

[17]  Hector J. Levesque Making Believers out of Computers , 1989 .

[18]  Dan Roth,et al.  Exploiting Relevance through Model-Based Reasoning , 1994 .

[19]  Grigoris Antoniou,et al.  Nonmonotonic reasoning , 1997 .

[20]  S. Kosslyn Image and mind , 1982 .

[21]  C.H. Papadimitriou,et al.  On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[22]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[23]  B. Selman Tractable default reasoning , 1991 .

[24]  Bart Selman,et al.  Model-Preference Default Theories , 1990, Artif. Intell..

[25]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[26]  Richard Statman,et al.  On the Structure of Armstrong Relations for Functional Dependencies , 1984, JACM.