Easy cases of probabilistic satisfiability

Annals of Mathematics and Artificial Intelligence

Volumn 33, Issue 1, 2001, Pages 69-91

  Andersen, Kim Allan ^a   Pretolani, Daniele ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF CAMERINO   (Italy)

Author keywords

Balanced matrices; Cnf formulas; Directed hypergraphs; Partial k trees; Probabilistic satisfiability

Indexed keywords

EID: 0035604555     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012332915908     Document Type: Article

References (28)

1. K.A. Andersen, Characterizing consistency in probabilistic logic for a class of Horn clauses, Mathematical Programming 66 (1994) 257-271.
2. K.A. Andersen, On consistency in probabilistic logic for logical formulas represented by B-hypertrees, European Journal of Operational Research 108 (1998) 696-709.
3. K.A. Andersen and J.N. Hooker, Bayesian logic, Decision Support Systems 16 (1994) 191-210.
4. K.A. Andersen and J.N. Hooker, Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs, Annals of Operations Research 65 (1996) 1-20.
5. G. Ausiello and R. Giaccio, On-line algorithms for satisfiability formulae with uncertainty, Theoretical Computer Science 171 (1997) 3-24.
6. H.L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science 209 (1998) 1-46.
7. V. Chandru and J.N. Hooker, Optimization Methods for Logical Inference (Wiley, New York, 1999).
8. M. Conforti and G. Cornuéjols, A class of logic problems solvable by Linear Programming, Journal of the Association for Computing Machinery 42 (1995) 1107-1113.
9. Y. Crama, P. Hansen and B. Jaumard, The basic algorithm for pseudo-Boolean programming revisited, Discrete Applied Mathematics 29 (1990) 171-185.
10. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
11. G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applications, Discrete Applied Mathematics 42 (1993) 177-201.
12. G. Gallo, C. Gentile, D. Pretolani and G. Rago, Max Horn SAT and the Minimum Cut problem in directed hypergraphs, Mathematical Programming 80 (1998) 213-237.
13. G. Georgakopoulos, D. Kavvadias and C.H. Papadimitriou, Probabilistic satisfiability, Journal of Complexity 4 (1988) 1-11.
14. T. Hailperin, Boole's Logic and Probability, 2nd edn., Studies in Logic and the Foundations of Mathematics, Vol. 85 (North-Holland, Amsterdam, 1986).
15. P. Hansen, B. Jaumard and M. Poggi de Aragão, Mixed-integer column generation algorithms and the Probabilistic Maximum Satisfiability Problem, GERAD Research Report 91-53, Montrèal (1991).
16. P. Hansen, B. Jaumard and M. Poggi de Aragão, Boole's conditions of possible experience and reasoning under uncertainty, Discrete Applied Mathematics 60 (1995) 181-193.
17. J. Hooker, A mathematical programming model for probabilistic logic, working paper 05-88-89, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1988).
18. B. Jaumard, P. Hansen and M.P. de Aragão, Column generation methods for probabilistic logic, ORSA Journal on Computing 3(2) (1991) 135-148.
19. B. Jaumard and B. Simeone, On the complexity of the Maximum Satisfiability Problem for Horn formulas, Information Processing Letters 26 (1987/88) 1-4.
20. D. Kavvadias and C.H. Papadimitriou, A Linear Programming approach to reasoning about probabilities, Annals of Mathematics and Artificial Intelligence 1 (1990) 189-205.
21. J. Kratochvíl and M. Křivánek, Satisfiability of co-nested formulas, Acta Informatica 30 (1993) 397-403.
22. N.J. Nilsson, Probabilistic logic, Artificial Intelligence 28 (1986) 71-87.
23. P. Nobili and A. Sassano, (0, ±1) ideal matrices, Mathematical Programming 80 (1998) 265-281.
24. D. Pretolani, Satisfiability and hypergraphs, Ph.D. thesis, TD-12/93, Dipartimento di Informatica, University of Pisa, Italy (1993).
25. G. Rago, Optimization hypergraphs and logical inference, Ph.D. thesis, TD-4/94, Dipartimento di Informatica, University of Pisa, Italy (1993).
26. K. Truemper, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, Journal of Combinatorial Theory B 32 (1982) 112-139.
27. L.C. van der Gaag, Probability-based models for plausible reasoning, Ph.D. thesis, University of Amsterdam (1990).
28. L.C. van der Gaag, Computing probability intervals under independence constraints, in: Uncertainty in Artificial Intelligence, Vol. 6, eds. P.P. Bonissone, L.N. Kanal and J.F. Lemmer (1991) pp. 457-466.