{"type":"ScholarlyArticle","title":"Probabilistic Satisfiability: Logic-Based Algorithms and Phase Transition","authors":[{"name":"Marcelo Finger","slug":"marcelo-finger","given":"Marcelo","family":"Finger","affiliation":""},{"name":"Glauber De Bona","slug":"glauber-de-bona","given":"Glauber","family":"De Bona","affiliation":""}],"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.","doi":"10.5591/978-1-57735-516-8/IJCAI11-096","url":"https://ijcai.org/proceedings/2011/96","pdf":"https://ijcai.org/proceedings/2011/0096.pdf","markdown":"https://ijcai.org/proceedings/2011/96.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/96","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":96,"pages":{"first":528,"last":532},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}