Probabilistic satisfiability

[1]  L. N. Kanal,et al.  Uncertainty in Artificial Intelligence 5 , 1990 .

[2]  J. Goffin,et al.  Cutting planes and column generation techniques with the projective algorithm , 1990 .

[3]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[5]  Kathryn B. Laskey,et al.  Assumptions, Beliefs and Probabilities , 1989, Artif. Intell..

[6]  Yves Crama,et al.  Recognition problems for special classes of polynomials in 0–1 variables , 1989, Math. Program..

[7]  Endre Boros,et al.  Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur , 1989, Math. Oper. Res..

[8]  Jeff B. Paris,et al.  On the applicability of maximum entropy to inexact reasoning , 1989, Int. J. Approx. Reason..

[9]  John Skilling,et al.  Maximum Entropy and Bayesian Methods , 1989 .

[10]  Madan M. Gupta,et al.  Fuzzy Computing: Theory, Hardware, and Applications , 1988 .

[11]  Ronald Fagin,et al.  A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[12]  András Prékopa,et al.  Boole-Bonferroni Inequalities and Linear Programming , 1988, Oper. Res..

[13]  I. R. Goodman.  A measure-free approach to conditioning , 1988, Int. J. Approx. Reason..

[14]  Didier Dubois,et al.  A Tentative Comparison of Numerical Approximate Reasoning Methodologies , 1987, Int. J. Man Mach. Stud..

[15]  H. E. Stephanou,et al.  Perspectives on imperfect information processing , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  Philip G. Calabrese,et al.  An algebraic synthesis of the foundations of logic and probability , 1987, Inf. Sci..

[17]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[18]  S. V. Chesnokov,et al.  The effect of semantic freedom in the logic of natural language , 1987 .

[19]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[20]  Charles J. Colbourn,et al.  Improving reliability bounds in computer networks , 1986, Networks.

[21]  J. Yael Assous.  First-and second-order bounds on terminal reliability , 1986, Networks.

[22]  Ernest W. Adams,et al.  On the logic of high probability , 1986, Journal of Philosophical Logic.

[23]  Pierre Hansen,et al.  Unimodular functions , 1986, Discrete Applied Mathematics.

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

[25]  Mary McLeish,et al.  Probabilistic Logic: Some Comments and Possible use for Nonmonotonic Reasoning , 1988, UAI 1988.

[26]  Giordano Bruno,et al.  Confronto fra eventi condizionati di probabilità nulla nell'inferenza statistica Bayesiana , 1985 .

[27]  Alain Billionnet,et al.  Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions , 1985, Discret. Appl. Math..

[28]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[29]  Lotfi A. Zadeh,et al.  Is Probability Theory Sufficient for Dealing with Uncertainty in AI: A Negative View , 1985, UAI.

[30]  Bruce G. Buchanan,et al.  The MYCIN Experiments of the Stanford Heuristic Programming Project , 1985 .

[31]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[32]  J. Ross Quinlan,et al.  Inferno: A Cautious Approach To Uncertain Inference , 1986, Comput. J..

[33]  F. Barahona.  The max-cut problem on graphs not contractible to K5 , 1983 .

[34]  M. E. Dyer,et al.  The Complexity of Vertex Enumeration Methods , 1983, Math. Oper. Res..

[35]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[36]  Dana S. Nau,et al.  Expert computer systems , 1983, Computer.

[37]  Eitan Zemel,et al.  Polynomial algorithms for estimating network reliability , 1982, Networks.

[38]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[39]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[40]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[41]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[42]  Richard M. Karp,et al.  On linear characterizations of combinatorial optimization problems , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[43]  Mihalis Yannakakis,et al.  Testing the Universal Instance Assumption , 1980, Inf. Process. Lett..

[44]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[45]  Robert G. Bland,et al.  New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..

[46]  D. Lewis.  Probabilities of Conditionals and Conditional Probabilities , 1976 .

[47]  Stratis Kounias,et al.  Best Linear Bonferroni Bounds , 1976 .

[48]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[49]  Edward J. McCluskey,et al.  Probabilistic Treatment of General Combinational Networks , 1975, IEEE Transactions on Computers.

[50]  Edward J. McCluskey,et al.  Analysis of Logic Circuits with Faults Using Input Signal Probabilities , 1975, IEEE Transactions on Computers.

[51]  E. W. Adams,et al.  The logic of conditionals , 1975 .

[52]  Ernest W. Adams,et al.  The logic of ‘Almost all’ , 1974, J. Philos. Log..

[53]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[54]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[55]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[56]  M. Balinski.  Notes—On a Selection Problem , 1970 .

[57]  M. Desu.  A Selection Problem , 1970 .

[58]  P. Suppes.  Probabilistic Inference and the Concept of Total Evidence , 1969 .

[59]  G. Schay.  An algebra of conditional events , 1968 .

[60]  P. Hammer,et al.  Boolean Methods in Operations Research and Related Areas , 1968 .

[61]  Werner Dinkelbach.  On Nonlinear Fractional Programming , 1967 .

[62]  J. Hintikka,et al.  Aspects of Inductive Logic. , 1968 .

[63]  S. Reiter,et al.  Discrete Optimizing Solution Procedures for Linear and Nonlinear Integer Programming Problems , 1966 .

[64]  E. W. Adams,et al.  Probability and the Logic of Conditionals , 1966 .

[65]  T. Hailperin,et al.  Best Possible Inequalities for the Probability of a Logical Function of Events , 1965 .

[66]  A. Charnes,et al.  Programming with linear fractional functionals , 1962 .

[67]  R. Fortet.  L’algebre de Boole et ses applications en recherche operationnelle , 1960 .

[68]  G. Dantzig.  ON THE SIGNIFICANCE OF SOLVING LINEAR PROGRAMMING PROBLEMS WITH SOME INTEGER VARIABLES , 1960 .

[69]  Leonard Goddard,et al.  Laws of thought , 1959 .

[70]  B. D. Finetti.  La prévision : ses lois logiques, ses sources subjectives , 1937 .

[71]  B. Russell,et al.  A Treatise on Probability , 1921 .

[72]  M. Fekete,et al.  Über ein problem von laguerre , 1912 .

[73]  George Boole Ll.D..  XXV. On certain propositions in algebra connected with the theory of probabilities , 1855 .

[74]  G. Boole.  An Investigation of the Laws of Thought: On which are founded the mathematical theories of logic and probabilities , 2007 .

[75]  George Boole Ll.D..  LIV. On a general method in the theory of probabilities , 1854 .

[76]  George Boole.  XIII. On the conditions by which the solutions of questions in the theory of probabilities are limited , 1854 .

[77]  Henry Wilbraham,et al.  LXXIV. On the theory of chances developed in Professor Boole's “laws of thought” , 2022 .