{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:46:04Z","timestamp":1778589964642,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9269,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0885-064x(88)90006-4","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:01:23Z","timestamp":1099764083000},"page":"1-11","source":"Crossref","is-referenced-by-count":117,"title":["Probabilistic satisfiability"],"prefix":"10.1016","volume":"4","author":[{"given":"George","family":"Georgakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Kavvadias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos H","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(88)90006-4_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0885-064X(88)90006-4_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0885-064X(88)90006-4_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/BF02579273","article-title":"The Ellipsoid Method and Its Consequences in Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1980"},{"issue":"1","key":"10.1016\/0885-064X(88)90006-4_BIB4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(80)90114-3","article-title":"Testing the universal instance assumption","volume":"10","author":"Honeyman","year":"1980","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10.1016\/0885-064X(88)90006-4_BIB5","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1137\/0211053","article-title":"On linear characterization of combinatorial optimization problems","volume":"11","author":"Karp","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(88)90006-4_BIB6","author":"Kavvadias","year":"1987"},{"issue":"5","key":"10.1016\/0885-064X(88)90006-4_BIB7","first-page":"1093","article-title":"A polynomial algorithm for linear programming","volume":"244","author":"Khachian","year":"1979","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0885-064X(88)90006-4_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/MC.1983.1654302","article-title":"Expert computer systems","author":"Nau","year":"1983","journal-title":"Comput. Surv."},{"key":"10.1016\/0885-064X(88)90006-4_BIB9","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(86)90031-7","article-title":"Probabilistic logic","author":"Nilsson","year":"1986"},{"key":"10.1016\/0885-064X(88)90006-4_BIB10","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"issue":"3","key":"10.1016\/0885-064X(88)90006-4_BIB11","doi-asserted-by":"crossref","DOI":"10.1109\/TPAMI.1985.4767656","article-title":"A computational approach to approximate and plausible reasoning with applications to expert systems","volume":"7","author":"Prade","year":"1985","journal-title":"IEEE Trans. PAMI"},{"key":"10.1016\/0885-064X(88)90006-4_BIB13","unstructured":"Tsitsiklis J. N. (1986), Personal communication, February."},{"key":"10.1016\/0885-064X(88)90006-4_BIB12","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","article-title":"Fuzzy sets","volume":"8","author":"Zadeh","year":"1971","journal-title":"Inform. Contr."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:23:03Z","timestamp":1549099383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X88900064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0885064X88900064"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(88)90006-4","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}