{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:28:26Z","timestamp":1760819306425,"version":"3.40.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1012332915908","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T18:14:30Z","timestamp":1041185670000},"page":"69-91","source":"Crossref","is-referenced-by-count":18,"title":["Easy Cases of Probabilistic Satisfiability"],"prefix":"10.1007","volume":"33","author":[{"given":"Kim Allan","family":"Andersen","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Pretolani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"359699_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01581149","volume":"66","author":"K.A. Andersen","year":"1994","unstructured":"K.A. Andersen, Characterizing consistency in probabilistic logic for a class of Horn clauses, Mathematical Programming 66 (1994) 257-271.","journal-title":"Mathematical Programming"},{"key":"359699_CR2","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1016\/S0377-2217(97)00179-3","volume":"108","author":"K.A. Andersen","year":"1998","unstructured":"K.A. Andersen, On consistency in probabilistic logic for logical formulas represented by B-hypertrees, European Journal of Operational Research 108 (1998) 696-709.","journal-title":"European Journal of Operational Research"},{"key":"359699_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0167-9236(94)90031-0","volume":"16","author":"K.A. Andersen","year":"1994","unstructured":"K.A. Andersen and J.N. Hooker, Bayesian logic, Decision Support Systems 16 (1994) 191-210.","journal-title":"Decision Support Systems"},{"key":"359699_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02187324","volume":"65","author":"K.A. Andersen","year":"1996","unstructured":"K.A. Andersen and J.N. Hooker, Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs, Annals of Operations Research 65 (1996) 1-20.","journal-title":"Annals of Operations Research"},{"key":"359699_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(96)00123-5","volume":"171","author":"G. Ausiello","year":"1997","unstructured":"G. Ausiello and R. Giaccio, On-line algorithms for satisfiability formulae with uncertainty, Theoretical Computer Science 171 (1997) 3-24.","journal-title":"Theoretical Computer Science"},{"key":"359699_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"H.L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science 209 (1998) 1-46.","journal-title":"Theoretical Computer Science"},{"key":"359699_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033166","volume-title":"Optimization Methods for Logical Inference","author":"V. Chandru","year":"1999","unstructured":"V. Chandru and J.N. Hooker, Optimization Methods for Logical Inference (Wiley, New York, 1999)."},{"key":"359699_CR8","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1145\/210118.210137","volume":"42","author":"M. Conforti","year":"1995","unstructured":"M. Conforti and G. Cornu\u00e9jols, A class of logic problems solvable by Linear Programming, Journal of the Association for Computing Machinery 42 (1995) 1107-1113.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"359699_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y. Crama","year":"1990","unstructured":"Y. Crama, P. Hansen and B. Jaumard, The basic algorithm for pseudo-Boolean programming revisited, Discrete Applied Mathematics 29 (1990) 171-185.","journal-title":"Discrete Applied Mathematics"},{"key":"359699_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, New York, 1979)."},{"key":"359699_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G. Gallo","year":"1993","unstructured":"G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applications, Discrete Applied Mathematics 42 (1993) 177-201.","journal-title":"Discrete Applied Mathematics"},{"key":"359699_CR12","first-page":"213","volume":"80","author":"G. Gallo","year":"1998","unstructured":"G. Gallo, C. Gentile, D. Pretolani and G. Rago, Max Horn SAT and the Minimum Cut problem in directed hypergraphs, Mathematical Programming 80 (1998) 213-237.","journal-title":"Mathematical Programming"},{"key":"359699_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","volume":"4","author":"G. Georgakopoulos","year":"1988","unstructured":"G. Georgakopoulos, D. Kavvadias and C.H. Papadimitriou, Probabilistic satisfiability, Journal of Complexity 4 (1988) 1-11.","journal-title":"Journal of Complexity"},{"key":"359699_CR14","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Boole' Logic and Probability","author":"T. Hailperin","year":"1986","unstructured":"T. Hailperin, Boole' Logic and Probability, 2nd edn., Studies in Logic and the Foundations of Mathematics, Vol. 85 (North-Holland, Amsterdam, 1986).","edition":"2nd edn."},{"key":"359699_CR15","unstructured":"P. Hansen, B. Jaumard and M. Poggi de Arag\u00e3o, Mixed-integer column generation algorithms and the Probabilistic Maximum Satisfiability Problem, GERAD Research Report 91-53, Montr\u00e8al (1991)."},{"key":"359699_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(94)00050-N","volume":"60","author":"P. Hansen","year":"1995","unstructured":"P. Hansen, B. Jaumard and M. Poggi de Arag\u00e3o, Boole' conditions of possible experience and reasoning under uncertainty, Discrete Applied Mathematics 60 (1995) 181-193.","journal-title":"Discrete Applied Mathematics"},{"key":"359699_CR17","series-title":"working paper 05-88-89","volume-title":"A mathematical programming model for probabilistic logic","author":"J. Hooker","year":"1988","unstructured":"J. Hooker, A mathematical programming model for probabilistic logic, working paper 05-88-89, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1988)."},{"issue":"2","key":"359699_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/ijoc.3.2.135","volume":"3","author":"B. Jaumard","year":"1991","unstructured":"B. Jaumard, P. Hansen and M.P. de Arag\u00e3o, Column generation methods for probabilistic logic, ORSA Journal on Computing 3(2) (1991) 135-148.","journal-title":"ORSA Journal on Computing"},{"key":"359699_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(87)90028-7","volume":"26","author":"B. Jaumard","year":"1987","unstructured":"B. Jaumard and B. Simeone, On the complexity of the Maximum Satisfiability Problem for Horn formulas, Information Processing Letters 26 (1987\/88) 1-4.","journal-title":"Information Processing Letters"},{"key":"359699_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01531078","volume":"1","author":"D. Kavvadias","year":"1990","unstructured":"D. Kavvadias and C.H. Papadimitriou, A Linear Programming approach to reasoning about probabilities, Annals of Mathematics and Artificial Intelligence 1 (1990) 189-205.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"359699_CR21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01209713","volume":"30","author":"J. Kratochv\u00edl","year":"1993","unstructured":"J. Kratochv\u00edl and M. K\u0159riv\u00e1nek, Satisfiability of co-nested formulas, Acta Informatica 30 (1993) 397-403.","journal-title":"Acta Informatica"},{"key":"359699_CR22","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N.J. Nilsson","year":"1986","unstructured":"N.J. Nilsson, Probabilistic logic, Artificial Intelligence 28 (1986) 71-87.","journal-title":"Artificial Intelligence"},{"key":"359699_CR23","first-page":"265","volume":"80","author":"P. Nobili","year":"1998","unstructured":"P. Nobili and A. Sassano, (0,\u00b11) ideal matrices, Mathematical Programming 80 (1998) 265-281.","journal-title":"Mathematical Programming"},{"key":"359699_CR24","volume-title":"Satisfiability and hypergraphs","author":"D. Pretolani","year":"1993","unstructured":"D. Pretolani, Satisfiability and hypergraphs, Ph.D. thesis, TD-12\/93, Dipartimento di Informatica, University of Pisa, Italy (1993)."},{"key":"359699_CR25","volume-title":"Optimization hypergraphs and logical inference","author":"G. Rago","year":"1993","unstructured":"G. Rago, Optimization hypergraphs and logical inference, Ph.D. thesis, TD-4\/94, Dipartimento di Informatica, University of Pisa, Italy (1993)."},{"key":"359699_CR26","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0095-8956(82)90028-4","volume":"32","author":"K. Truemper","year":"1982","unstructured":"K. Truemper, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, Journal of Combinatorial Theory B 32 (1982) 112-139.","journal-title":"Journal of Combinatorial Theory B"},{"key":"359699_CR27","unstructured":"L.C. van der Gaag, Probability-based models for plausible reasoning, Ph.D. thesis, University of Amsterdam (1990)."},{"key":"359699_CR28","first-page":"457","volume":"6","author":"L.C. van der Gaag","year":"1991","unstructured":"L.C. van der Gaag, Computing probability intervals under independence constraints, in: Uncertainty in Artificial Intelligence, Vol. 6, eds. P.P. Bonissone, L.N. Kanal and J.F. Lemmer (1991) pp. 457-466.","journal-title":"Uncertainty in Artificial Intelligence"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012332915908.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1012332915908\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012332915908.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:35:08Z","timestamp":1747546508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1012332915908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["359699"],"URL":"https:\/\/doi.org\/10.1023\/a:1012332915908","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}