{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:49Z","timestamp":1747548349408},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651413"},{"type":"electronic","value":"9783540495451"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49545-2_24","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:41:28Z","timestamp":1186425688000},"page":"355-367","source":"Crossref","is-referenced-by-count":1,"title":["Propositional Lower Bounds: Generalization and Algorithms"],"prefix":"10.1007","author":[{"given":"Marco","family":"Cadoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Palopoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Scarcello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,2,26]]},"reference":[{"key":"24_CR1","unstructured":"M. Cadoli, Semantical and computational aspects of Horn approximations. In Proc. of IJCAI-93, pages 39\u201344, 1993."},{"key":"24_CR2","doi-asserted-by":"publisher","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. J. of the ACM, 42:1107\u20131113, 1995.","journal-title":"J. of the ACM"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W. P. Dowling","year":"1984","unstructured":"W. P. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. of Logic Programming, 1:267\u2013284, 1984.","journal-title":"J. of Logic Programming"},{"key":"24_CR4","unstructured":"A. del Val. An analysis of approximate knowledge compilation. In Proc. of IJCAI-95, pages 830\u2013836, 1995."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, A catalog of complexity classes. In Handbook of theoretical computer science, Chapter 2, pages 67\u2013161, J. van Leeuwen ed., Elsevier Sc. Pub., 1990.","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"24_CR6","unstructured":"H. A. Kautz and B. Selman. Forming concepts for fast inference. In Proc. of AAAI-92, pages 786\u2013793, 1992."},{"key":"24_CR7","unstructured":"H. A. Kautz and B. Selman. An empirical evaluation of knowledge compilation by theory approximation. In Proc. of AAAI-94, pages 155\u2013161, 1994."},{"key":"24_CR8","unstructured":"R. Schrag. Compilation for critically constrained knowledge bases. In Proc. of AAAI-96, pages 510\u2013515, 1996."},{"key":"24_CR9","unstructured":"B. Selman and H. A. Kautz. Knowledge compilation using Horn approximations. In Proc. of AAAI-91, pages 904\u2013909, 1991."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/226643.226644","volume":"43","author":"B. Selman","year":"1996","unstructured":"B. Selman and H. A. Kautz. Knowledge compilation and theory approximation. J. of the ACM, 43:193\u2013224, 1996.","journal-title":"J. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49545-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T01:03:07Z","timestamp":1550710987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49545-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651413","9783540495451"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-49545-2_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}