Skip to main content
×
Home
    • Aa
    • Aa

Inductive Logic Programming in Databases: From Datalog to

  • FRANCESCA A. LISI (a1)
Abstract
Abstract

In this paper we address an issue that has been brought to the attention of the database community with the advent of the Semantic Web, i.e., the issue of how ontologies (and semantics conveyed by them) can help solving typical database problems, through a better understanding of Knowledge Representation (KR) aspects related to databases. In particular, we investigate this issue from the ILP perspective by considering two database problems, (i) the definition of views and (ii) the definition of constraints, for a database whose schema is represented also by means of an ontology. Both can be reformulated as ILP problems and can benefit from the expressive and deductive power of the KR framework . We illustrate the application scenarios by means of examples.

    • Send article to Kindle

      To send this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Inductive Logic Programming in Databases: From Datalog to
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Inductive Logic Programming in Databases: From Datalog to
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Inductive Logic Programming in Databases: From Datalog to
      Available formats
      ×
Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

H. Blockeel , L. De Raedt , N. Jacobs and B. Demoen 1999. Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery 3, 5993.

A. Borgida 1996. On the relative expressiveness of description logics and predicate logics. Artificial Intelligence 82, 1–2, 353367.

W. Buntine 1988. Generalized subsumption and its application to induction and redundancy. Artificial Intelligence 36, 2, 149176.

D. Calvanese , G. De Giacomo , D. Lembo , M. Lenzerini and R. Rosati 2007. Tractable reasoning and efficient query answering in description logics: The dl-lite family. Journal of Automated Reasoning 39, 3, 385429.

D. Calvanese , G. De Giacomo and M. Lenzerini 2008. Conjunctive query containment and answering under description logics constraints. ACM Transactions on Computational Logic 9, 3.

S. Ceri , G. Gottlob and L. Tanca 1989. What you always wanted to know about datalog (and never dared to ask). IEEE Transactions on Knowledge and Data Engineering 1, 1, 146166.

S. Ceri , G. Gottlob and L. Tanca 1990. Logic Programming and Databases. Springer.

L. De Raedt and L. Dehaspe 1997. Clausal discovery. Machine Learning 26, 2–3, 99146.

L. De Raedt and S. Džeroski 1994. First order jk-clausal theories are PAC-learnable. Artificial Intelligence 70, 375392.

F. Donini , M. Lenzerini , D. Nardi and A. Schaerf 1998. $\mathcal{AL}$-log: Integrating datalog and description logics. Journal of Intelligent Information Systems 10, 3, 227252.

S. Džeroski and N. Lavrač , Eds. 2001. Relational Data Mining. Springer.

T. Eiter , G. Gottlob and H. Mannila 1997. Disjunctive Datalog. ACM Transactions on Database Systems 22, 3, 364418.

P. Flach 1998. From extensional to intensional knowledge: Inductive logic programming techniques and their application to deductive databases. In Transactions and Change in Logic Databases, B. Freitag , H. Decker , M. Kifer and A. Voronkov , Eds. Lecture Notes in Computer Science, vol. 1472. Springer, 356387.

T. Gruber 1993. A translation approach to portable ontology specifications. Knowledge Acquisition 5, 199220.

I. Horrocks , P. Patel-Schneider and F. van Harmelen 2003. From $\mathcal{SHIQ}$ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics 1, 1, 726.

I. Horrocks , U. Sattler and S. Tobies 2000. Practical reasoning for very expressive description logics. Logic Journal of the IGPL 8, 3, 239263.

A. Levy and M.-C. Rousset 1998. Combining Horn rules and description logics in CARIN. Artificial Intelligence 104, 165209.

F. A. Lisi and F. Esposito 2008. Foundations of onto-relational learning. In Inductive Logic Programming, F. Železný and N. Lavrač , Eds. Lecture Notes in Artificial Intelligence, vol. 5194. Springer, 158175.

F. A. Lisi and D. Malerba 2004. Inducing multi-level association rules from multiple relations. Machine Learning 55, 175210.

R. Michalski 1983. A theory and methodology of inductive learning. In Machine Learning: an artificial intelligence approach, R. Michalski , J. Carbonell and T. Mitchell , Eds. Vol. I. Morgan Kaufmann, San Mateo, CA.

T. Mitchell 1982. Generalization as search. Artificial Intelligence 18, 203226.

S. Nienhuys-Cheng and R. de Wolf 1997. Foundations of Inductive Logic Programming. Lecture Notes in Artificial Intelligence, vol. 1228. Springer.

J. Quinlan 1990. Learning logical definitions from relations. Machine Learning 5, 239266.

R. Reiter 1980. Equality and domain closure in first order databases. Journal of ACM 27, 235249.

R. Rosati 2005a. On the decidability and complexity of integrating ontologies and rules. Journal of Web Semantics 3, 1, 6173.

R. Rosati 2005b. Semantic and computational advantages of the safe integration of ontologies and rules. In Principles and Practice of Semantic Web Reasoning, F. Fages and S. Soliman , Eds. Lecture Notes in Computer Science, vol. 3703. Springer, 5064.

C. Rouveirol and V. Ventos 2000. Towards learning in CARIN-$\mathcal{ALN}$. In Inductive Logic Programming, J. Cussens and A. Frisch , Eds. Lecture Notes in Artificial Intelligence, vol. 1866. Springer, 191208.

M. Schmidt-Schauss and G. Smolka 1991. Attributive concept descriptions with complements. Artificial Intelligence 48, 1, 126.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 85 *
Loading metrics...

Abstract views

Total abstract views: 37 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th March 2017. This data will be updated every 24 hours.