Abstract
This paper deals with learning in \(\mathcal{AL}\)-log, a hybrid language that merges the function-free Horn clause language Datalog and the description logic \(\mathcal{ALC}\). Our application context is descriptive data mining. We introduce \(\mathcal{O}\)-queries, a rule-based form of unary conjunctive queries in \(\mathcal{AL}\)-log, and a generality order ≽ B for structuring spaces of \(\mathcal{O}\)-queries. We define a (downward) refinement operator ρ O for ≽ B -ordered spaces of \(\mathcal{O}\)-queries, prove its ideality and discuss an efficient implementation of it in the context of interest.
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
Badea, L., Nienhuys-Cheng, S.-W.: 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)
Badea, L., Stanciu, M.: Refinement operators can be (weakly) perfect. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 21–32. Springer, Heidelberg (1999)
Borgida, A.: On the relative expressiveness of description logics and predicate logics. Artificial Intelligence 82(1–2), 353–367 (1996)
Buntine, W.: Generalized subsumption and its application to induction and redundancy. Artificial Intelligence 36(2), 149–176 (1988)
Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)
Cohen, W., Hirsh, H.: Learning the CLASSIC description logic: Thoretical and experimental results. In: Proc. of the 4th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 1994), pp. 121–133. Morgan Kaufmann, San Francisco (1994)
Dehaspe, L., Toivonen, H.: Discovery of frequent Datalog patterns. Data Mining and Knowledge Discovery 3, 7–36 (1999)
Donini, F., Lenzerini, M., Nardi, D., Schaerf, A.: AL-log: Integrating Datalog and Description Logics. Journal of Intelligent Information Systems 10(3), 227–252 (1998)
Frisch, A.: The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence 49, 161–198 (1991)
Frisch, A.: Sorted downward refinement: Building background knowledge into a refinement operator for inductive logic programming. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 104–115. Springer, Heidelberg (1999)
Frisch, A., Cohn, A.: Thoughts and afterthoughts on the 1988 workshop on principles of hybrid reasoning. AI Magazine 11(5), 84–87 (1991)
Kietz, J.-U.: Learnability of description logic programs. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 117–132. Springer, Heidelberg (2003)
Kietz, J.-U., Morik, K.: A polynomial approach to the constructive induction of structural knowledge. Machine Learning 14(1), 193–217 (1994)
Levy, A., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artificial Intelligence 104, 165–209 (1998)
Lisi, F.A.: An ILP Setting for Object-Relational Data Mining. Ph.D. Thesis, Department of Computer Science, University of Bari, Italy (2002)
Lisi, F.A., Ferilli, S., Fanizzi, N.: Object Identity as Search Bias for Pattern Spaces. In: van Harmelen, F. (ed.) ECAI 2002. Proceedings of the 15th European Conference on Artificial Intelligence, pp. 375–379. IOS Press, Amsterdam (2002)
Lisi, F.A., Malerba, D.: Bridging the Gap between Horn Clausal Logic and Description Logics in Inductive Learning. In: Cappelli, A., Turini, F. (eds.) AI*IA 2003: Advances in Artificial Intelligence. LNCS (LNAI), Springer, Heidelberg (2003) (to appear)
Lisi, F.A., Malerba, D.: Towards Object-Relational Data Mining. In: Flesca, S., Greco, S., Saccà, D., Zumpano, E. (eds.) Proc. of the 11th Italian Symposium on Advanced Database Systems, pp. 269–280. Rubbettino Editore, Italy (2003)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997)
Nienhuys-Cheng, S.-H., de Wolf, R. (eds.): Foundations of Inductive Logic Programming. LNCS (LNAI), vol. 1228. Springer, Heidelberg (1997)
Reiter, R.: Equality and domain closure in first order databases. Journal of ACM 27, 235–249 (1980)
Rouveirol, C., Ventos, V.: Towards Learning in CARIN-ALN. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 191–208. Springer, Heidelberg (2000)
Schmidt-Schauss, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence 48(1), 1–26 (1991)
Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., Ferilli, S.: A logic framework for the incremental inductive synthesis of Datalog theories. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, pp. 300–321. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lisi, F.A., Malerba, D. (2003). Ideal Refinement of Descriptions in \(\mathcal{AL}\)-Log. In: Horváth, T., Yamamoto, A. (eds) Inductive Logic Programming. ILP 2003. Lecture Notes in Computer Science(), vol 2835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39917-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-39917-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20144-1
Online ISBN: 978-3-540-39917-9
eBook Packages: Springer Book Archive