Abstract
CF-induction is a sound and complete procedure for finding hypotheses in full clausal theories. It is based on the principle of Inverse Entailment (IE), and consists of two procedures: construction of a bridge theory and generalization of it. There are two possible ways to realize the generalization task in CF-induction. One uses a single deductive operator, called γ-operator, and the other uses a recently proposed form of inverse subsumption. Whereas both are known to retain the completeness of CF-induction, their logical relationship and empirical features have not been clarified yet. In this paper, we show their equivalence property and clarify the difference on their search strategies, which often leads to significant features on their obtained hypotheses.
This research is supported by 2008-2011 JSPS Grant-in-Aid for Scientific Research (A) (No. 20240016) and 2010-2012 JSPS Grant-in-Aid for Young Scientists (B) (No. 22700141).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Christensen, T.S., Oliveira, A.P., Nielsen, J.: Reconstruction and logical modeling of glucose repression signaling pathways in Saccharomyces cerevisiae. BMC Systems Biology 3, 7 (2009), doi:10.1186/1752-0509-3-7
Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: a brief survey. Discrete Applied Mathematics 156, 2035–2049 (2008)
Inoue, K.: Induction as consequence finding. Machine Learning 55(2), 109–135 (2004)
Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence 56(2-3), 301–353 (1992)
Kimber, T., Broda, K., Russo, A.: Induction on Failure: Learning Connected Horn Theories. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 169–181. Springer, Heidelberg (2009)
Muggleton, S.H.: Inverse entailment and Progol. New Generation Computing 13, 245–286 (1995)
Muggleton, S.H., Buntine, W.L.: Machine invention of first-order predicates by inverting resolution. In: Proc. of the 5th Int. Conf. on Machine Learning, pp. 339–352 (1988)
Nabeshima, H., Iwanuma, K., Inoue, K.: SOLAR: A Consequence Finding System for Advanced Reasoning. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 257–263. Springer, Heidelberg (2003)
Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS, vol. 1228. Springer, Heidelberg (1997)
Ray, O., Broda, K., Russo, A.: Hybrid Abductive Inductive Learning: A Generalisation of Progol. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 311–328. Springer, Heidelberg (2003)
Ray, O., Inoue, K.: Mode-Directed Inverse Entailment for Full Clausal Theories. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 225–238. Springer, Heidelberg (2008)
Rymon, R.: An SE-tree based prime implicant generation algorithm. Annals of Mathematics and Artificial Intelligence, 351–366 (1994)
Uno, T.: A practical fast algorithm for enumerating minimal set coverings. IPSJ SIG Notes (29), 9–16 (2002)
Westergaard, S.L., Oliveira, A.P., Bro, C., Olsson, L., Nielsen, J.: A systems biology approach to study glucose repression in the yeast Saccharomyces cerevisiae. Biotechnology and Bioengineering 96, 134–145 (2006)
Yamamoto, A.: Hypothesis finding based on upward refinement of residue hypotheses. Theoretical Computer Science 298, 5–19 (2003)
Yamamoto, Y., Ray, O., Inoue, K.: Towards a Logical Reconstruction of CF-Induction. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol. 4914, pp. 330–343. Springer, Heidelberg (2008)
Yamamoto, Y., Inoue, K., Iwanuma, K.: Hypothesis enumeration by CF-induction. In: Proc. of the 6th Workshop on Learning with Logics and Logics for Learning, pp. 80–87 (2009)
Yamamoto, Y., Inoue, K., Iwanuma, K.: Inverse subsumption for complete explanatory induction. Machine Learning 86(1), 115–139 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, Y., Inoue, K., Iwanuma, K. (2012). Comparison of Upward and Downward Generalizations in CF-Induction. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds) Inductive Logic Programming. ILP 2011. Lecture Notes in Computer Science(), vol 7207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31951-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-31951-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31950-1
Online ISBN: 978-3-642-31951-8
eBook Packages: Computer ScienceComputer Science (R0)