Skip to main content
SpringerLink
Log in

Efficient Evaluation of Candidate Hypotheses in \(\mathcal{AL}\)-log

  • Conference paper
Inductive Logic Programming (ILP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3194))

Included in the following conference series:

Abstract

In this paper we face the coverage problem in the context of learning in the hybrid language \(\mathcal{AL}\)-log. Here candidate hypotheses are represented as Datalog clauses with variables constrained by assertions in the description logic \(\mathcal{ALC}\). Regardless of the scope of induction we define coverage relations for \(\mathcal{AL}\)-log in the two logical settings of learning from implications and learning from interpretations. Also, with reference to the ILP system \(\mathcal{AL}\)-QuIn, we discuss our solutions to the algorithmic and implementation issues raised by the coverage test for the setting of characteristic induction from interpretations in \(\mathcal{AL}\)-log.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Berners-Lee, T.: Weaving the Web. Harper, San Francisco (1999)

    Google Scholar 

  3. Blockeel, H., De Raedt, L., Jacobs, N., Demoen, B.: Scaling Up Inductive Logic Programming by Learning from Interpretations. Data Mining and Knowledge Discovery 3, 59–93 (1999)

    Article  Google Scholar 

  4. Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)

    Google Scholar 

  5. De Raedt, L.: Logical Settings for Concept-Learning. Artificial Intelligence 95(1), 187–201 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. De Raedt, L., Ďzeroski, S.: First order jk-clausal theories are PAC-learnable. Artificial Intelligence 70, 375–392 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Di Mauro, N., Altomare, T.M., Ferilli, S., Esposito, F., Fanizzi, N.: An Exhaustive Matching Procedure for the Improvement of Learning Efficiency. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 112–129. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: AL-log: Integrating Datalog and Description Logics. Journal of Intelligent Information Systems 10(3), 227–252 (1998)

    Article  Google Scholar 

  9. Frazier, M., Page, C.D.: Learnability in inductive logic programming. In: Proceedings of the 10st National Conference on Artificial Intelligence, pp. 93–98. The AAAI Press/The MIT Press (1993)

    Google Scholar 

  10. Horrocks, I., Patel-Schneider, P.F.: A Proposal for an OWL Rules Language. In: Proc. of the 13th International World Wide Web Conference, ACM, New York (2004) (to appear)

    Google Scholar 

  11. Horrocks, P.F.: Patel-Schneider, and F. van Harmelen. From SHIQ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics 1(1), 7–26 (2003)

    Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Klug, A.C.: On conjunctive queries containing inequalities. Journal of ACM 35(1), 146–160 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  14. Levy, A.Y., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artificial Intelligence 104, 165–209 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. 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)

    Google Scholar 

  16. 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. LNCS, vol. 2829, pp. 49–60. Springer, Heidelberg (2003)

    Google Scholar 

  17. 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)

    Chapter  Google Scholar 

  18. Lisi, F.A., Malerba, D.: Inducing Multi-Level Association Rules from Multiple Relations. Machine Learning 55, 175–210 (2004)

    Article  MATH  Google Scholar 

  19. Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997)

    Article  Google Scholar 

  20. Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS, vol. 1228. Springer, Heidelberg (1997)

    Google Scholar 

  21. Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries. In: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, Arizona, May 12-14, pp. 12–19. ACM Press, New York (1997)

    Chapter  Google Scholar 

  22. 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)

    Chapter  Google Scholar 

  23. Schmidt-Schauss, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence 48(1), 1–26 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  24. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, University of Bari, Italy

    Francesca A. Lisi & Floriana Esposito

Authors
  1. Francesca A. Lisi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Floriana Esposito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculdade de Engenharia & LIAAD, Universidade do Porto, Portugal

    Rui Camacho

  2. Department of Computer Science, Penglais, Aberystwyth, Ceredigion, University of Wales, SY23 3DB, Wales, UK

    Ross King

  3. Dept. of Computer Science and Engineering & Centre for Health Informatics, University of New South Wales, Sydney

    Ashwin Srinivasan

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lisi, F.A., Esposito, F. (2004). Efficient Evaluation of Candidate Hypotheses in \(\mathcal{AL}\)-log. In: Camacho, R., King, R., Srinivasan, A. (eds) Inductive Logic Programming. ILP 2004. Lecture Notes in Computer Science(), vol 3194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30109-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30109-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22941-4

  • Online ISBN: 978-3-540-30109-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation