{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:55Z","timestamp":1759637635454},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>We analyze a classical generalized probabilistic satisfiability problem (GGenPSAT) which consists in deciding the satisfiability of Boolean combinations of linear inequalities involving probabilities of classical propositional formulas. GGenPSAT coincides precisely with the satisfiability problem of the probabilistic logic of Fagin et al. and was proved to be NP-complete. Here, we present a polynomial reduction of GGenPSAT to SMT over the quantifier-free theory of linear integer and real arithmetic. Capitalizing on this translation, we implement and test a solver for the GGenPSAT problem. As previously observed for many other NP-complete problems, we are able to detect a phase transition behavior for GGenPSAT.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/126","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T09:14:07Z","timestamp":1501233247000},"page":"908-914","source":"Crossref","is-referenced-by-count":1,"title":["Classical Generalized Probabilistic Satisfiability"],"prefix":"10.24963","author":[{"given":"Carlos","family":"Caleiro","sequence":"first","affiliation":[{"name":"SQIG - Instituto de Telecomunica\u00e7\u00f5es"},{"name":"DMath, Instituto Superior T\u00e9cnico"},{"name":"Universidade de Lisboa, Portugal"}]},{"given":"Filipe","family":"Casal","sequence":"additional","affiliation":[{"name":"CMAF-CIO, Portugal"},{"name":"DMath, Instituto Superior T\u00e9cnico"},{"name":"Universidade de Lisboa, Portugal"}]},{"given":"Andreia","family":"Mordido","sequence":"additional","affiliation":[{"name":"INOV INESC Inova\u00e7\u00e3o, Portugal"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T11:52:23Z","timestamp":1501242743000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/126"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/126","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}