fcasal / ggenpsat

GGenPSAT solver - a satisfiability solver for a probabilistic logic

GGenPSAT

GGenPSAT solver

• decides the satisfiability of Boolean combinations of linear inequalities involving probabilities of classical propositional formulas. In other words, it's a satisfiability solver for Fagin et al. probabilistic logic [2]

Requires

• python
• yices

Run

• Use python ggenpsat.py -i ifile -o ofile to run the program on input file ifile and output the the smt-lib translation file ofile.
• Then, use yices ofile to run Yices on the translated file ofile. If this command returns sat the original problem is satisfiable, otherwise the original problem is unsatisfiable.

Input file format

The solver accepts input files in a similar format to standard smt-lib:

One example of this format is the following

(define x::bool)
(define y::bool)

(assertprop (or (not x) x))

(assert (= (pr (not (<=> (xor x y) y))) (/ 1 2)))
(assert (or (= (pr y) 0) (= (pr y) 1)))
(check)

which corresponds to the GGenPSAT problem

Releases

• v0.1 -- Initial release in December 2016

References

• [1] C. Caleiro, F. Casal, and A. Mordido. Classical Generalized Probabilistic Satisfiability. PDF, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, Main track. Pages 908-914, IJCAI-17, 2017.
• [2] R. Fagin, J. Y. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Inf. Comput., 87(1-2):78–128, 1990.