Proceedings

Probabilistic Satisfiability: Logic-Based Algorithms and Phase Transition

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 528-532.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-096

Abstract

In this paper, we study algorithms for probabilistic satisfiability (PSAT), an NP-complete problem, and their empiric complexity distribution. We define a PSAT normal form, based on which we propose two logic-based algorithms: a reduction of normal form PSAT instances to SAT, and a linear-algebraic algorithm with a logic-based column generation strategy. We conclude that both algorithms present a phase transition behaviour and that the latter has a much better performance.

Marcelo Finger, and Glauber De Bona. 2011. Probabilistic Satisfiability: Logic-Based Algorithms and Phase Transition. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 528–532. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-096
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards