{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:30Z","timestamp":1779174870757,"version":"3.51.4"},"reference-count":41,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6324,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0004-3702(94)00092-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"273-302","source":"Crossref","is-referenced-by-count":286,"title":["On the hardness of approximate reasoning"],"prefix":"10.1016","volume":"82","author":[{"given":"Dan","family":"Roth","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)00092-1_BIB1","author":"Bacchus","year":"1990"},{"key":"10.1016\/0004-3702(94)00092-1_BIB2","series-title":"Proceedings AAAI-92","first-page":"602","article-title":"From statistics to beliefs","author":"Bacchus","year":"1992"},{"key":"10.1016\/0004-3702(94)00092-1_BIB3","series-title":"Proceedings IJCAI-93","first-page":"39","article-title":"Semantical and computational aspects of Horn approximations","author":"Cadoli","year":"1993"},{"key":"10.1016\/0004-3702(94)00092-1_BIB4","author":"Carnap","year":"1950"},{"key":"10.1016\/0004-3702(94)00092-1_BIB5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","article-title":"The computational complexity of probabilistic inference using Bayesian belief networks","volume":"42","author":"Cooper","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","article-title":"Approximating probabilistic inference in Bayesian belief networks is NP-hard","volume":"60","author":"Dagum","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB7","series-title":"Encyclopedia of Artificial Intelligence","article-title":"Constraint networks","author":"Dechter","year":"1992"},{"key":"10.1016\/0004-3702(94)00092-1_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","article-title":"Structure identification in relational data","volume":"58","author":"Dechter","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB10","author":"Garey","year":"1979"},{"key":"10.1016\/0004-3702(94)00092-1_BIB11","series-title":"Proceedings International Conference on the Principles of Knowledge Representation and Reasoning","first-page":"383","article-title":"Learning useful Horn approximations","author":"Greiner","year":"1992"},{"key":"10.1016\/0004-3702(94)00092-1_BIB12","series-title":"Proceedings 24th ACM Symposium of the Theory of Computing","first-page":"294","article-title":"Asymptotic conditional probabilities for first-order logic","author":"Grove","year":"1992"},{"key":"10.1016\/0004-3702(94)00092-1_BIB13","author":"Holtzman","year":"1989"},{"key":"10.1016\/0004-3702(94)00092-1_BIB14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0004-3702(94)00092-1_BIB15","series-title":"Proceedings 24th IEEE Symposium of Foundations of Computer Science","first-page":"56","article-title":"Monte-Carlo algorithms for enumeration and reliability problems","author":"Karp","year":"1983"},{"key":"10.1016\/0004-3702(94)00092-1_BIB16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","article-title":"Horn approximations of empirical data","volume":"74","author":"Kautz","year":"1995","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB17","series-title":"Proceedings International Workshop on Processing Declarative Knowledge","article-title":"A general framework for knowledge compilation","author":"Kautz","year":"1991"},{"key":"10.1016\/0004-3702(94)00092-1_BIB18","series-title":"Proceedings AAAI-92","first-page":"786","article-title":"Forming concepts for fast inference","author":"Kautz","year":"1992"},{"key":"10.1016\/0004-3702(94)00092-1_BIB19","series-title":"Proceedings AAAI-94","first-page":"155","article-title":"An empirical evaluation of knowledge compilation by theory approximation","author":"Kautz","year":"1994"},{"key":"10.1016\/0004-3702(94)00092-1_BIB20_1","series-title":"Proceedings AAAI-94","first-page":"682","article-title":"Learning to reason","author":"Khardon","year":"1994"},{"key":"10.1016\/0004-3702(94)00092-1_BIB20_2","series-title":"Technical Report TR-02-94","author":"Khardon","year":"1994"},{"key":"10.1016\/0004-3702(94)00092-1_BIB21_1","series-title":"Proceedings of the National Conference on Artificial Intelligence","first-page":"1148","article-title":"Reasoning with models","author":"Khardon","year":"1994"},{"key":"10.1016\/0004-3702(94)00092-1_BIB21_2","author":"Khardon","year":"1994"},{"key":"10.1016\/0004-3702(94)00092-1_BIB22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(86)90068-8","article-title":"Making believers out of computers","volume":"30","author":"Levesque","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraint: fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inf. Sci."},{"key":"10.1016\/0004-3702(94)00092-1_BIB24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","article-title":"Probabilistic logic","volume":"28","author":"Nilsson","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(90)90103-7","article-title":"Dempster's rule of combination is #P-complete","volume":"44","author":"Orponen","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00092-1_BIB26","author":"Pearl","year":"1988"},{"key":"10.1016\/0004-3702(94)00092-1_BIB27","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0888-613X(90)90013-R","article-title":"Reasoning with belief functions: an analysis of compatibility","volume":"4","author":"Pearl","year":"1990","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/0004-3702(94)00092-1_BIB28","series-title":"Proceedings IJCAI-93","first-page":"607","article-title":"Average-case analysis of a search algorithm for estimating prior and posterior probabilities in Bayesian networks with extreme probabilities","author":"Poole","year":"1993"},{"issue":"4","key":"10.1016\/0004-3702(94)00092-1_BIB29","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(94)00092-1_BIB30","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0888-613X(90)90016-U","article-title":"A logical-based analysis of Dempster-Shafer theory","volume":"4","author":"Provan","year":"1990","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/0004-3702(94)00092-1_BIB31","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0888-613X(92)90032-U","article-title":"The validity of Dempster-Shafer belief functions","volume":"6","author":"Provan","year":"1992","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/0004-3702(94)00092-1_BIB32","series-title":"Proceedings AAAI-91","first-page":"904","article-title":"Knowledge compilation using Horn approximations","author":"Selman","year":"1991"},{"key":"10.1016\/0004-3702(94)00092-1_BIB33","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0888-613X(90)90012-Q","article-title":"Perspectives of the theory and practice of belief functions","volume":"4","author":"Shafer","year":"1990","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/0004-3702(94)00092-1_BIB34","article-title":"Randomized algorithms for counting and generating combinatorial structures","author":"Sinclair","year":"1988"},{"key":"10.1016\/0004-3702(94)00092-1_BIB35","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/0214060","article-title":"On approximation algorithms for #P","volume":"14","author":"Stockmeyer","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(94)00092-1_BIB36","series-title":"Proceedings 30th IEEE Symposium of Foundations of Computer Science","first-page":"514","article-title":"On the computational power of PP and \u2295P","author":"Toda","year":"1989"},{"key":"10.1016\/0004-3702(94)00092-1_BIB37","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0004-3702(94)00092-1_BIB38","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"issue":"11","key":"10.1016\/0004-3702(94)00092-1_BIB39","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Commun. ACM"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294000921?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294000921?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:27:39Z","timestamp":1555064859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294000921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0004370294000921"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)00092-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}