{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:19:41Z","timestamp":1752229181370},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_158","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:33:45Z","timestamp":1330292025000},"page":"250-259","source":"Crossref","is-referenced-by-count":3,"title":["The inverse satisfiability problem"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Kavvadias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martha","family":"Sideri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"2\u20133","key":"26_CR1","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"D. Angluin, M. Frazier, L. Pitt: Learning conjunctions of Horn clauses. Machine Learning 9(2\u20133) (1992) 147\u2013164","journal-title":"Machine Learning"},{"key":"26_CR2","unstructured":"C. C. Chang, H. J. Keisler: Model Theory North Holland (1990)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"S. A. Cook: The complexity of theorem-proving procedures. Third Annual ACM Symposium on Theory of Computing, (1971) 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"26_CR4","unstructured":"N. Creignou and M. Hermann: Complexity of Generalized Satisfiability Counting Problems. Information and Computation. Yet to appear, as of 95.Nov."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","volume":"58","author":"R. Dechter","year":"1993","unstructured":"R. Dechter and J. Pearl: Structure identification in relational data. Artificial Intelligence 58 (1993) 237\u2013270","journal-title":"Artificial Intelligence"},{"key":"26_CR6","unstructured":"M. R. Genesereth, N. J. Nilsson: Logical Foundations of Artificial Intelligence. Morgan Kauffmann Publishers (1987)"},{"key":"26_CR7","unstructured":"G. Gogic, C. H. Papadimitriou, M. Sideri: Incremental recompilation of knowledge. National Conference on Artificial Intelligence (1994) 922\u2013927"},{"issue":"1","key":"26_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","volume":"74","author":"H. A. Kautz","year":"1995","unstructured":"H. A. Kautz, M. J. Kearns, B. Selman: Horn approximations of empirical data. Artificial Intelligence 74(1) (1995) 129\u2013145","journal-title":"Artificial Intelligence"},{"key":"26_CR9","unstructured":"H. A. Kautz, M. J. Kearns, B. Selman: Reasoning with characteristic models. National Conference on Artificial Intelligence (1993) 34\u201339"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"D. Kavvadias, C. H. Papadimitriou, M. Sideri: On Horn envelopes and hypergraph transversals. International Symposium on Algorithms and Complexity (1993) Hong Kong 399\u2013405","DOI":"10.1007\/3-540-57568-5_271"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy: Circumscription \u2014 a form of nonmonotonic reasoning. Artificial Intelligence 13 (1980) 27\u201339","journal-title":"Artificial Intelligence"},{"key":"26_CR12","unstructured":"C. H. Papadimitriou: Computational Complexity. Addison Wesley (1994)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter: A Logic for default reasoning. Artificial Intelligence 13 (1980) 81\u2013132","journal-title":"Artificial Intelligence"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"T. J. Schaefer: The complexity of satisfiability problems. Tenth Annual ACM Symposium on Theory of Computing (1978) 216\u2013226","DOI":"10.1145\/800133.804350"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(90)90010-W","volume":"45","author":"B. Selman","year":"1990","unstructured":"B. Selman, H. A. Kautz: Model preference default theories. Artificial Intelligence 45 (1990) 287\u2013322","journal-title":"Artificial Intelligence"},{"key":"26_CR16","unstructured":"B. Selman, H. A. Kautz: Knowledge compilation using Horn approximation. National Conference on Artificial Intelligence (1991) 904\u2013909"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_158.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:34Z","timestamp":1619573494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_158","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}