Optimization and probabilistic satisfiability on nested and co-nested formulas

• Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. New York: Prentice Hall.

  Google Scholar 

• Andersen, K. A., & Pretolani, D. (2001). Easy cases of probabilistic satisfiability. Annals of Mathematics and Artificial Intelligence, 33, 69–91.

  Article  Google Scholar 

• Baioletti, G., Capotorti, A., Tulipani, S., & Vantaggi, B. (2000). Elimination of Boolean variables for probabilistic coherence. Soft Computing, 4(2), 81–88.

  Article  Google Scholar 

• Baioletti, G., Capotorti, A., Tulipani, S., & Vantaggi, B. (2002). Simplification rules for the coherent probabilistic assessment problem. Annals of Mathematics and Artificial Intelligence, 35, 11–28.

  Article  Google Scholar 

• Boole, G. (1854). An investigation of the laws of thought. London: Walton and Maberlay.

  Google Scholar 

• Conforti, M., & Cornuéjols, G. (1995). A class of logic problems solvable by linear programming. Journal of the ACM, 42, 1107–1113.

  Article  Google Scholar 

• Crama, Y., Hansen, P., & Jaumard, B. (1990). The basic algorithm for pseudo-Boolean programming revisited. Discrete Applied Mathematics, 29, 171–185.

  Article  Google Scholar 

• Georgakopoulos, G., Kavvadias, D., & Papadimitriou, C. H. (1988). Parabilistic satisfiability. Journal of Complexity, 4, 1–11.

  Article  Google Scholar 

• Hailperin, T. (1986). Boole’s logic and probability (2nd ed.) Studies in logic and the foundations of mathematics (Vol. 85). Amsterdam: North-Holland.

  Google Scholar 

• Knuth, D. E. (1990). Nested satisfiability. Acta Informatica, 28, 1–6.

  Article  Google Scholar 

• Kratochvíl, J., & Křivánek, M. (1993). Satisfiability of co-nested formulas. Acta Informatica, 30, 397–403.

  Article  Google Scholar 

• Nilsson, N. J. (1986). Probabilistic logic. Artificial Intelligence, 28, 71–87.

  Article  Google Scholar 

• Pretolani, D. (2004). Hypergraphs reduction and satisfiability problems. In Lecture notes comp. sci.: Vol. 2919. Theory and application of satisfiability testing, 6th international conference, SAT 2003 (pp. 383–397). Berlin: Springer.

  Google Scholar 

• Pretolani, D. (2005). Probability logic and optimization SAT: The PSAT and CPA models. Annals of Mathematics and Artificial Intelligence, 43, 211–221.

  Google Scholar 

• Yen, J. Y. (1971). Finding the K shortest loopless paths in a network. Management Science, 17(11), 712–716.

  Article  Google Scholar 

Download references