Typical models: minimizing false beliefs

A knowledge system S describing a part of real world does in general not contain complete information. Reasoning with incomplete information is prone to errors since any belief derived from S may be false in the present state of the world. A false belief may suggest wrong decisions and lead to harmful actions. So an important goal is to make false beliefs as unlikely as possible. This work introduces the notions of "typical atoms" and "typical models", and shows that reasoning with typical models minimizes the expected number of false beliefs over all ways of using incomplete information. Various properties of typical models are studied, in particular, correctness and stability of beliefs suggested by typical models, and their connection to oblivious reasoning.

[1]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[2]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

[3]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[4]  Marc Thurley,et al.  sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP , 2006, SAT.

[5]  Eliezer L. Lozinskii,et al.  Information and evidence in logic systems , 1994, J. Exp. Theor. Artif. Intell..

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

[7]  Eliezer L. Lozinskii,et al.  Approximate reasoning with credible subsets , 1997, J. Exp. Theor. Artif. Intell..

[8]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

[10]  Richard Hull,et al.  Positivism vs minimalism in deductive databases , 1985, PODS '86.

[11]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[12]  Yoav Shoham,et al.  A semantical approach to nonmonotonic logics , 1987, LICS 1987.

[13]  Bart Selman,et al.  Model Counting: A New Strategy for Obtaining Good Bounds , 2006, AAAI.

[14]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[15]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[16]  Eliezer L. Lozinskii.  Counting Propositional Models , 1992, Inf. Process. Lett..

[17]  Bart Selman,et al.  A New Approach to Model Counting , 2005, SAT.

[18]  Eliezer L. Lozinskii,et al.  The Good Old Davis-Putnam Procedure Helps Counting Models , 2011, J. Artif. Intell. Res..

[19]  Vasco M. Manquinho,et al.  Counting Models in Integer Domains , 2006, SAT.

[20]  Eliezer L. Lozinskii.  Impurity: Another Phase Transition of SAT , 2006, J. Satisf. Boolean Model. Comput..