{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:09Z","timestamp":1725561309365},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208518"},{"type":"electronic","value":"9783540246053"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24605-3_29","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:50:35Z","timestamp":1280393435000},"page":"383-397","source":"Crossref","is-referenced-by-count":1,"title":["Hypergraph Reductions and Satisfiability Problems"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Pretolani","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"29_CR1","first-page":"69","volume":"33","author":"K.A. Andersen","year":"2001","unstructured":"Andersen, K.A., Pretolani, D.: Easy Cases of Probabilistic Satisfiability. Annals of Mathematics and A.I.\u00a033(1), 69\u201391 (2001)","journal-title":"Annals of Mathematics and A.I."},{"key":"29_CR2","unstructured":"Bacchus, F., Dalmao, S., Pitassi, T.: DPLL with Caching: A new algorithm for #SAT and Bayesian Inference., ECCC Report TR03-003 (2003), Available at \n                  \n                    http:\/\/eccc.uni-trier.de\/eccc-local\/Lists\/TR-2003.html"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s005000000040","volume":"4","author":"M. Baioletti","year":"2000","unstructured":"Baioletti, M., Capotorti, A., Tulipani, S., Vantaggi, B.: Elimination of Boolean variables for Probabilistic Coherence. Soft Computing\u00a04(2), 81\u201388 (2000)","journal-title":"Soft Computing"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209, 1\u201346 (1998)","journal-title":"Theoretical Computer Science"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y. Crama","year":"1990","unstructured":"Crama, Y., Hansen, P., Jaumard, B.: The Basic Algorithm for pseudo-Boolean programming revisited. Discrete Applied Mathematics\u00a029, 171\u2013185 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02983372","volume":"28","author":"D. Knuth","year":"1990","unstructured":"Knuth, D.: Nested Satisfiability. Acta Informatica\u00a028, 1\u20136 (1990)","journal-title":"Acta Informatica"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01209713","volume":"30","author":"J. Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl, J., K\u0159iv\u00e1nek, M.: Satisfiability of co-nested formulas. Acta Informatica\u00a030, 397\u2013403 (1993)","journal-title":"Acta Informatica"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N.J. Nilsson","year":"1986","unstructured":"Nilsson, N.J.: Probabilistic Logic. Artificial Intelligence\u00a028, 71\u201387 (1986)","journal-title":"Artificial Intelligence"},{"key":"29_CR9","unstructured":"Pretolani, D.: Probability Logic and Optimization SAT: the PSAT and CPA Models. Presented at SAT 2002, Cincinnati, Ohio (May 2002), Accepted for publication in Annals of Mathematics and A.I."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(95)00019-9","volume":"54","author":"J.S. Schlipf","year":"1995","unstructured":"Schlipf, J.S., Annexstein, F.S., Franco, J.V., Swaminathan, R.P.: On finding solutions for extended Horn formulas. Information Processing Letters\u00a054, 133\u2013137 (1995)","journal-title":"Information Processing Letters"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/inco.2000.2867","volume":"158","author":"H. Maaren van","year":"2000","unstructured":"van Maaren, H.: A Short Note on Some Tractable Cases of the Satisfiability Problem. Information and Computation\u00a0158, 125\u2013130 (2000)","journal-title":"Information and Computation"},{"key":"29_CR12","unstructured":"Szeider, S.: On fixed-parameter tractable parametrizations of SAT. In: Proceedings of the Sixth Int. Conf. on Theory and Applications of Satisfiability Testing, S.Margherita Ligure, Italy, May 5-8, pp. 108\u2013116 (2003)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24605-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:09:49Z","timestamp":1552835389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24605-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208518","9783540246053"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24605-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}