Approximate reasoning with credible subsets

The complexity of logical inference in knowledge systems grows with the system size, determined, in particular, by the number of its clauses. This growth is so rapid, that reasoning in sizeable systems becomes intractable.However, given a system S and a query Q, should we be able to detect a subset of S informative enough to provide a correct answer to Q, and small enough to fit into the range of tractable computation,the answer to Q could be produced efficiently. This paper presents a way of implementing this idea.

[1]  J. Justice.  Maximum entropy and bayesian methods in applied statistics , 1986 .

[2]  I. Good,et al.  The Maximum Entropy Formalism. , 1979 .

[3]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[4]  G. J. Janacek,et al.  Maximum Entropy and Bayesian Spectral Analysis and Estimation Problems , 1987 .

[5]  Kazuo Iwama,et al.  CNF Satisfiability Test by Counting and Polynomial Average Time , 1989, SIAM J. Comput..

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

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

[8]  ELIEZER L. LOZINSKII,et al.  Is there an alternative to parsimonious semantics? , 1995, J. Exp. Theor. Artif. Intell..

[9]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .

[10]  C. R. Smith,et al.  Maximum-Entropy and Bayesian Methods in Inverse Problems , 1985 .

[11]  R. Hartley.  Transmission of information , 1928 .

[12]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[13]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[14]  P. M. Williams.  Bayesian Conditionalisation and the Principle of Minimum Information , 1980, The British Journal for the Philosophy of Science.

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

[16]  Paul Walton Purdom,et al.  Average Time Analyses of Simplified Davis-Putnam Procedures , 1982, Inf. Process. Lett..

[17]  I. Good,et al.  The Maximum Entropy Formalism. , 1979 .

[18]  Judea Pearl,et al.  Probabilistic Semantics for Nonmonotonic Reasoning: A Survey , 1989, KR.

[19]  Paul Walton Purdom,et al.  The Pure Literal Rule and Polynomial Average Time , 1985, SIAM J. Comput..

[20]  Daniel Kahneman,et al.  Probabilistic reasoning , 1993 .

[21]  Eliezer L. Lozinskii.  A Simple Test Improves Checking Satisfiability , 1993, J. Log. Program..

[22]  Amnon Barak,et al.  The MOSIX Distributed Operating System , 1993, Lecture Notes in Computer Science.

[23]  E. Shortliffe.  Computer-based medical consultations: mycin (elsevier north holland , 1976 .

[24]  David Heckerman,et al.  Probabilistic Interpretation for MYCIN's Certainty Factors , 1990, UAI.

[25]  E. T. Jaynes,et al.  Where do we Stand on Maximum Entropy , 1979 .

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

[27]  J. Aczél,et al.  Maximum Entropy and Bayesian Methods in Applied Statistics: Generalized Entropies and the Maximum Entropy Principle , 1986 .

[28]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[29]  Noam Nisan,et al.  Approximate Inclusion-Exclusion , 1990, Comb..

[30]  Amnon Barak,et al.  The MOSIX Distributed Operating System: Load Balancing for UNIX , 1993 .

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

[32]  M. Tribus.  Information Theory as the Basis for Thermostatics and Thermodynamics , 1961 .

[33]  Giorgio Gallo,et al.  Algorithms for Testing the Satisfiability of Propositional Formulae , 1989, J. Log. Program..

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

[35]  Norbert Wiener,et al.  Cybernetics: Control and Communication in the Animal and the Machine. , 1949 .

[36]  János Aczél,et al.  Entropies, Generalized Entropies, Inequalities, and the Maximum Entropy Principle , 1987 .

[37]  Moisés Goldszmidt,et al.  A Maximum Entropy Approach to Nonmonotonic Reasoning , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[38]  Edward H. Shortliffe,et al.  Computer-based medical consultations, MYCIN , 1976 .

[39]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[40]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[41]  Edward T. Lee,et al.  An algorithm for region filling using two‐dimensional grammars , 1987, Int. J. Intell. Syst..