Abstract
In Logic Programming, a thread of input/output variables is often used to carry state information through the body literals of the clauses that make up a logic program. When using Inductive Logic Programming (ILP) to synthesise logic programs, the standard refinement operators that define the search space cannot enforce this pattern and non-conforming clauses have to be discarded after being constructed. We present a new refinement operator that defines a search space that only includes Horn clauses that conform to this pattern of input/output variable threads, dramatically narrowing the search space and ILP run times. We further support our theoretical justification of the new operator with experimental results over a variety of datasets.
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
Asuncion, A., Newman, D.J.: UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Badea, L., Nienhuys-Cheng, S.-H.: A refinement operator for description logics. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 40–59. Springer, Heidelberg (2000)
Bobillo, F., Delgado, M., Gómez-Romero, J.: Optimizing the crisp representation of the fuzzy description logic \(\cal \mathcal{SROIQ}\). In: da Costa, P.C.G., d’Amato, C., Fanizzi, N., Laskey, K.B., Laskey, K.J., Lukasiewicz, T., Nickles, M., Pool, M. (eds.) URSW 2005-2007. LNCS (LNAI), vol. 5327, pp. 189–206. Springer, Heidelberg (2008)
Cohen, W.W., Hirsh, H.: Learning the CLASSIC description logic: Theoretical and experimental results. In: Proceedings 4th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pp. 121–133 (1994)
Cussens, J., Pulman, S.: Experiments in inductive chart parsing. In: Cussens, J., Džeroski, S. (eds.) LLL 1999. LNCS (LNAI), vol. 1925, pp. 143–156. Springer, Heidelberg (2000)
Fanizzi, N.: Concept induction in Description Logics using information-theoretic heuristics. Intl. J. on Semantic Web and Information Systems 7(2) (2011)
Iannone, L., Palmisano, I., Fanizzi, N.: An algorithm based on counterfactuals for concept learning in the semantic web. Journal of Applied Intelligence 26(2), 139–159 (2007)
Konstantopoulos, S., Charalambidis, A.: Formulating description logic learning as an inductive logic programming task. In: Proceedings of Intl Conference on Fuzzy Systems (FUZZ-IEEE 2010), July 18-23. IEEE, Barcelona (2010)
Larson, J., Michalski, R.S.: Inductive inference of VL decision rules. ACM SIGART Bulletin 63, 38–44 (1977)
Lehmann, J., Hitzler, P.: A refinement operator based learning algorithm for the \(\mathcal{ALC}\) description logic. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 147–160. Springer, Heidelberg (2008)
Lisi, F.A., Straccia, U.: Can ILP deal with incomplete and vague structured knowledge? In: Proceedings ILP, Windsor Great Park, U.K. (2011)
Muggleton, S.: Inverse entailment and Progol. New Generation Computing 13, 245–286 (1995)
Pereira, F., Warren, D.S.: Parsing as deduction. In: Dunno (ed.) Proceedings of the 21st Conference of the ACL, pp. 137–144 (1983)
Srinivasan, A.: The Aleph Manual (2004), http://www.comlab.ox.ac.uk/activities/machinelearning/Aleph/
Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston (1986)
W3C OWL Working Group, OWL 2 web ontology language. W3C Recommendation (October 27, 2009), http://www.w3.org/TR/owl2-overview
Zelle, J.M., Mooney, R.J.: Learning to parse database queries using Inductive Logic Programming. In: Proceedings of the 13th National Conference on Artificial Intelligence, Portland, USA (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Charalambidis, A., Konstantopoulos, S. (2013). A Refinement Operator for Inducing Threaded-Variable Clauses. In: Riguzzi, F., Železný, F. (eds) Inductive Logic Programming. ILP 2012. Lecture Notes in Computer Science(), vol 7842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38812-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-38812-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38811-8
Online ISBN: 978-3-642-38812-5
eBook Packages: Computer ScienceComputer Science (R0)