{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:39:27Z","timestamp":1725496767387},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653851"},{"type":"electronic","value":"9783540493815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49381-6_7","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:47:50Z","timestamp":1196646470000},"page":"50-60","source":"Crossref","is-referenced-by-count":4,"title":["Disjunctions of Horn Theories and Their Cores"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"unstructured":"Y. Boufkhad. Algorithms for Propositional KB Approximation. In Proc. National Conference on AI (AAAI)\u2019 98, pp. 280\u2013285, Madison, Wisconsin, July 26\u201330, 1998.","key":"7_CR1"},{"unstructured":"M. Cadoli. Semantical and Computational Aspects of Horn Approximations. In Proc. IJCAI-93, pp. 39\u201344, 1993.","key":"7_CR2"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0004-3702(94)00009-P","volume":"74","author":"M. Cadoli","year":"1995","unstructured":"M. Cadoli and M. Schaerf. Tractable Reasoning via Approximation. Art. Intelligence, 74(2):249\u2013310, 1995.","journal-title":"Art. Intelligence"},{"unstructured":"A. del Val. An Analysis of Approximate Knowledge Compilation. In Proc. IJCAI-95, pp. 830\u2013837, 1995.","key":"7_CR4"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W. Dowling","year":"1984","unstructured":"W. Dowling and J. H. Gallier. Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Theories. Journal of Logic Programming, 3:267\u2013284, 1984.","journal-title":"Journal of Logic Programming"},{"unstructured":"T. Eiter, T. Ibaraki and K. Makino. Computing Intersections of Horn Theories for Reasoning with Models. In Proc. AAAI\u2019 98, pp. 292\u2013297, 1998.","key":"7_CR6"},{"doi-asserted-by":"crossref","unstructured":"T. Eiter, T. Ibaraki and K. Makino. Disjunctions of Horn Theories and their Cores. Manuscript, 1998.","key":"7_CR7","DOI":"10.1007\/3-540-49381-6_7"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1613\/jair.380","volume":"8","author":"G. Gogic","year":"1998","unstructured":"G. Gogic, C. Papadimitriou, and M. Sideri. Incremental Recompilation of Knowledge. J. Artificial Intelligence Research, 8:23\u201337, 1998.","journal-title":"J. Artificial Intelligence Research"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","volume":"74","author":"H. Kautz","year":"1995","unstructured":"H. Kautz, M. Kearns, and B. Selman. Horn Approximations of Empirical Data. Art. Intell., 74:129\u2013245, 1995.","journal-title":"Art. Intell"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/226643.226644","volume":"43","author":"H. Kautz","year":"1996","unstructured":"H. Kautz and B. Selman. Knowledge Compilation and Theory Approximation. JACM, 43(2):193\u2013224, 1996.","journal-title":"JACM"},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-57568-5_271","volume-title":"ISAAC-93","author":"D. Kavvadias","year":"1993","unstructured":"D. Kavvadias, C. Papadimitriou, and M. Sideri. On Horn Envelopes and Hypergraph Transversals. In W. Ng, ed., ISAAC-93, LNCS 762, 399\u2013405, 1993."},{"issue":"1\/2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(96)00006-9","volume":"87","author":"R. Khardon","year":"1996","unstructured":"R. Khardon and D. Roth. Reasoning with Models. Art. Intell., 87(1\/2):187\u2013213, 1996.","journal-title":"Art. Intell"},{"issue":"1\/2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"D. Roth. On the Hardness of Approximate Reasoning. Art. Intell., 82(1\/2):273\u2013302, 1996.","journal-title":"Art. Intell"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49381-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:54:32Z","timestamp":1551142472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49381-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653851","9783540493815"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-49381-6_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}