Probabilistic satisfiability

Georgakopoulos, G; Kavvadias, D; Papadimitriou, CH

dc.contributor.author	Georgakopoulos, G	en
dc.contributor.author	Kavvadias, D	en
dc.contributor.author	Papadimitriou, CH	en
dc.date.accessioned	2014-03-01T01:39:25Z
dc.date.available	2014-03-01T01:39:25Z
dc.date.issued	1988	en
dc.identifier.issn	0885064X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/22779
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-38249032896&partnerID=40&md5=975ab1bc3374e34112e295cf999bb0f4	en
dc.title	Probabilistic satisfiability	en
heal.type	journalArticle	en
heal.publicationDate	1988	en
heal.abstract	We study the following computational problem proposed by Nils Nilsson: Several clauses (disjunctions of literals) are given, and for each clause the probability that the clause is true is specified. We are asked whether these probabilities are consistent. They are if there is a probability distribution on the truth assignments such that the probability of each clause is the measure of its satisfying set of assignments. Since this problem is a generalization of the satisfiability problem for propositional calculus it is immediately NP-hard. We show that it is NP-complete even when there are at most two literals per clause (a case which is polynomial-time solvable in the non-probabilistic case). We use arguments from linear programming and graph theory to derive polynomial-time algorithms for some interesting special cases. © 1988.	en
heal.journalName	Journal of Complexity	en
dc.identifier.volume	4	en
dc.identifier.issue	1	en
dc.identifier.spage	1	en
dc.identifier.epage	11	en