Abstract
Mode declarations are a successful form of language bias in explanatory ILP. But, while they are heavily used in Horn systems, they have yet to be similarly exploited in more expressive clausal settings. This paper presents a mode-directed ILP procedure for full clausal logic. It employs a first-order inference engine to abductively and inductively explain a set of examples with respect to a background theory. Each stage of hypothesis formation is guided by mode declarations using a generalisation of efficient Horn clause techniques for inverting entailment. Our approach exploits language bias more effectively than previous non-Horn ILP methods and avoids the need for interactive user assistance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Green, C.: Theorem-proving by resolution as a basis for question-answering systems. Machine Intelligence 4, 183–205 (1969)
Inoue, K.: Linear resolution for Consequence Finding. Artificial Intelligence 56(2-3), 301–353 (1992)
Inoue, K.: Induction as Consequence Finding. Machine Learning 55(2), 109–135 (2004)
Iwanuma, K., Inoue, K.: Minimal answer computation and SOL. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 245–257. Springer, Heidelberg (2002)
Iwanuma, K., Inoue, K., Satoh, K.: Completeness of Pruning Methods for Consequence Finding Procedure SOL. In: Proceedings of the 3rd International Workshop on First-Order Theorem Proving, pp. 89–100 (2000)
Loveland, D.W.: Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam (1978)
Muggleton, S.H.: Inverse Entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)
Muggleton, S.H., Bryant, C.H.: Theory Completion Using Inverse Entailment. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 130–146. Springer, Heidelberg (2000)
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)
Ray, O.: Hybrid Abductive-Inductive Learning. PhD thesis, Dept. of Computing, Imperial College (2005), http://www.bcs.org/upload/pdf/oray.pdf
Ray, O., Broda, K., Russo, A.M.: 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., Broda, K., Russo, A.M.: Generalised Kernel Sets for Inverse Entailment. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 165–179. Springer, Heidelberg (2004)
Ray, O., Inoue, K.: A consequence finding approach for full clausal abduction. In: Proceedings of the 10th International Conference on Discovery Science (to appear, 2007)
Srinivasan, A.: The Aleph Manual (version 4) (2003), http://web.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/index.html
Stickel, M.E.: A Prolog technology theorem prover: A New Exposition and Implementation in Prolog. Theoretical Computer Science 104(1), 109–128 (1992)
Yamamoto, A.: Which hypotheses can be found with Inverse Entailment? In: Džeroski, S., Lavrač, N. (eds.) ILP 1997. LNCS, vol. 1297, pp. 296–308. Springer, Heidelberg (1997)
Yamamoto, A.: Hypothesis finding based on upward refinement of residue hypotheses. Theoretical Computer Science 298, 5–19 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ray, O., Inoue, K. (2008). Mode-Directed Inverse Entailment for Full Clausal Theories. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds) Inductive Logic Programming. ILP 2007. Lecture Notes in Computer Science(), vol 4894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78469-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-78469-2_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78468-5
Online ISBN: 978-3-540-78469-2
eBook Packages: Computer ScienceComputer Science (R0)