{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:48:40Z","timestamp":1725896920866},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319501"},{"type":"electronic","value":"9783642319518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31951-8_18","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:56:20Z","timestamp":1342832180000},"page":"173-188","source":"Crossref","is-referenced-by-count":3,"title":["DNF Hypotheses in Explanatory Induction"],"prefix":"10.1007","author":[{"given":"Katsumi","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"18_CR1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/1284320.1284323","volume":"54","author":"T. Eiter","year":"2007","unstructured":"Eiter, T., Makino, K.: On computing all abductive explanations from a propositional Horn theory. J. ACM\u00a054(5), Article 24 (2007)","journal-title":"J. ACM"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","volume":"56","author":"K. Inoue","year":"1992","unstructured":"Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence\u00a056, 301\u2013353 (1992)","journal-title":"Artificial Intelligence"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/B:MACH.0000023149.72125.e2","volume":"55","author":"K. Inoue","year":"2004","unstructured":"Inoue, K.: Induction as consequence finding. Machine Learning\u00a055, 109\u2013135 (2004)","journal-title":"Machine Learning"},{"key":"18_CR4","unstructured":"Inoue, K.: Logic programming for Boolean networks. In: Proceedings of IJCAI 2011, pp. 924\u2013930 (2011)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-45619-8_22","volume-title":"Logic Programming","author":"K. Inoue","year":"2002","unstructured":"Inoue, K., Sakama, C.: Disjunctive Explanations. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 317\u2013332. Springer, Heidelberg (2002)"},{"key":"18_CR6","unstructured":"Inoue, K., Sato, T., Ishihata, M., Kameya, Y., Nabeshima, H.: Evaluating abductive hypotheses using an EM algorithm on BDDs. In: Proceedings of IJCAI 2009, pp. 810\u2013815 (2009)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-31980-1_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H.S. Jin","year":"2005","unstructured":"Jin, H.S., Han, H.J., Somenzi, F.: Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 287\u2013300. Springer, Heidelberg (2005)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(96)00006-9","volume":"87","author":"R. Khardon","year":"1996","unstructured":"Khardon, R., Roth, D.: Reasoning with models. Artificial Intelligence\u00a087, 187\u2013213 (1996)","journal-title":"Artificial Intelligence"},{"key":"18_CR9","unstructured":"Kautz, H., Kearns, M., Selman, B.: Reasoning with characteristic models. In: Proceedings of AAAI 1993, pp. 34\u201339. AAAI Press (1993)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0747-7171(08)80029-6","volume":"9","author":"A. Kean","year":"1990","unstructured":"Kean, A., Tsiknis, G.: An incremental method for generating prime implicants\/implicates. J. Symbolic Computation\u00a09, 185\u2013206 (1990)","journal-title":"J. Symbolic Computation"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press (1994)","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Laird, P.D.: Learning from Good and Bad Data. Kluwer Academic (1988)","DOI":"10.1007\/978-1-4613-1685-5"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(86)90068-8","volume":"30","author":"H. Levesque","year":"1986","unstructured":"Levesque, H.: Making believers out of computers. Artificial Intelligence\u00a030, 81\u2013108 (1986)","journal-title":"Artificial Intelligence"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Marquis, P.: Consequence finding algorithms. In: Gabbay, D.M., Smets, P. (eds.) Handbook for Defeasible Reasoning and Uncertain Management Systems, vol.\u00a05, pp. 41\u2013145. Kluwer Academic (2000)","DOI":"10.1007\/978-94-017-1737-3_3"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"2002","unstructured":"McMillan, K.L.: Applying SAT Methods in Unbounded Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 250\u2013264. Springer, Heidelberg (2002)"},{"key":"18_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-48751-4_20","volume-title":"Inductive Logic Programming","author":"H. Midelfart","year":"1999","unstructured":"Midelfart, H.: A Bounded Search Space of Clausal Theories. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 210\u2013221. Springer, Heidelberg (1999)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverse entailment and Progol. New Generation Computing\u00a013, 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Muggleton, S., Buntine, W.: Machine invention of first-order predicate by inverting resolution. In: Proc. ML 1988, pp. 339\u2013351. Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-934613-64-4.50040-2"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/AIC-2010-0465","volume":"23","author":"H. Nabeshima","year":"2010","unstructured":"Nabeshima, H., Iwanuma, K., Inoue, K., Ray, O.: SOLAR: An automated deduction system for consequence finding. AI Communications\u00a023, 183\u2013203 (2010)","journal-title":"AI Communications"},{"key":"18_CR20","unstructured":"Plotkin, G.D.: A note on inductive generalization. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a05, pp. 153\u2013163. Edinburgh University Press (1970)"},{"key":"18_CR21","unstructured":"Reiter, R., de Kleer, J.: Foundations of assumption-based truth maintenance systems: preliminary report. In: Proceedings of AAAI 1987, pp. 183\u2013187 (1987)"},{"key":"18_CR22","unstructured":"Sebag, M.: Delaying the choice of bias: A disjunctive version space approach. In: Proceedings of ICML 1996, pp. 444\u2013452. Morgan Kaufmann (1996)"},{"key":"18_CR23","unstructured":"Simon, L., del Val, A.: Efficient consequence finding. In: Proceedings of IJCAI 2001, pp. 359\u2013365 (2001)"},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/PGEC.1967.264648","volume":"16","author":"P. Tison","year":"1967","unstructured":"Tison, P.: Generalized consensus theory and application to the minimization of Boolean functions. IEEE Trans. on Electronic Computers\u00a016(4), 446\u2013456 (1967)","journal-title":"IEEE Trans. on Electronic Computers"},{"key":"18_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-40992-0_12","volume-title":"Algorithmic Learning Theory","author":"A. Yamamoto","year":"2000","unstructured":"Yamamoto, A., Fronh\u00f6fer, B.: Hypotheses Finding via Residue Hypotheses with the Resolution Principle. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol.\u00a01968, pp. 156\u2013165. Springer, Heidelberg (2000)"},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10994-011-5250-y","volume":"86","author":"Y. Yamamoto","year":"2011","unstructured":"Yamamoto, Y., Inoue, K., Iwanuma, K.: Inverse subsumption for complete explanatory induction. Machine Learning\u00a086(1), 115\u2013139 (2011)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31951-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:51:58Z","timestamp":1620129118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31951-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319501","9783642319518"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31951-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}