Foundations of refinement operators for description logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4894 LNAI, Issue , 2008, Pages 161-174

  Lehmann, Jens ^a   Hitzler, Pascal ^b  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; FORMAL LOGIC; LOGIC PROGRAMMING; ONTOLOGY; SEMANTIC WEB;

DESCRIPTION LOGICS; REFINEMENT OPERATORS;

MATHEMATICAL OPERATORS;

EID: 40249088276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78469-2_18     Document Type: Conference Paper

References (20)

1. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
2. 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)
3. Badea, L.: Perfect refinement operators can be flexible. In: Horn, W. (ed.) Proceedings of the 14th European Conference on Artificial Intelligence, August 2000, pp. 266 270. IOS Press, Amsterdam (2000)
4. 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)
5. Cohen, W.W., Hirsh, IL: Learning the classic description logic: Theoretical and experimental results. In: Doyle, P.T.J., Sandewall, E. (eds.) Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, Bonn, FRG, May 1.994, pp. 121-133. Morgan. Kaufmann, San. Francisco (1994)
6. Esposito, F., Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G.: Knowledge-intensive induction of terminologies from metadata. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 441-455. Springer, Heidelberg (2004)
7. Fanizzi, N., Ferilli, S., Iannone, L., Palmisano, I., Semeraro, G.: Downward refinement in the ALN description, logic. In: 4th International Conference on Hybrid Intelligent Systems (HIS 2004), Kitakyushu, Japan, December 2004, pp. 68-73. IEEE Computer Society, Los Alamitos (2004)
8. Fanizzi, N., Ferilli, S., Di Mauro, N., Basile, T.M.A.: Spaces of theories with ideal, refinement operators. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003, pp. 527-532. Morgan Kaufmann, San Francisco (2003)
9. Iannone, L., Palmisano, I.: An algorithm based on counterfactuals for concept learning in the semantic web. In: Ali, M., Esposito, F. (eds.) Innovations in Applied Artificial Intelligence. Proceedings of the 18th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Bari, Italy, June 2005, pp. 370-379 (2005)
10. Kietz, J.-U., Morik, K.: A polynomial approach to the constructive induction of structural knowledge. Machine Learning 14, 193-217 (1994)
11. Lehmann, J.: Hybrid learning of ontology classes. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol. 4571, Springer, Heidelberg (2007)
12. Lehmann, J., Hitzler, P.: Foundations of refinement operators for description logics. In: Technical report. University of Leipzig (2007), http://www.jens-lehmann.org
13. Lehmann, J., Hitzler, P.: Foundations of refinement operators for description logics. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 161-174. Springer, Heidelberg (2007)
14. Lisi, F.A., Malerba, D.: Ideal refinement of descriptions in AL-log. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 215-232. Springer, Heidelberg (2003)
15. Mitchell, T.: Machine Learning. McGraw Hill, New York (1997)
16. Nienhuys-Cheng, S.-H., Van Laer, W., Ramon, J., De Raedt, L.: Generalizing refinement operators to learn prenex conjunctive normal forms. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 245-256. Springer, Heidelberg (1999)
17. Nienhuys-Cheng, S.H., van der Laag, P.R.J., van der Torre, L.W.N.: Constructing refinement operators by decomposing logical implication. In: Torasso, P. (ed.) AI*IA 1993. LNCS, vol. 728, pp. 178-189. Springer, Heidelberg (1993)
18. Nienhuys-Cheng, S.-H, de Wolf, R. (eds.): Foundations of Inductive Logic Programming. LNCS, vol. 1.228. Springer, Heidelberg (1997)
19. Shapiro, E.Y.: Inductive inference of theories from facts. In: Lassez, J.L., Plotkin, G.D. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 199-255. MIT Press, Cambridge (1991)
20. van der Laag, P.R.J., Nienhuys-Cheng, S.-H.: Existence and nonexistence of complete refinement operators. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS, vol. 784, pp. 307-322. Springer, Heidelberg (1994).