• Aucun résultat trouvé

Logic-based Rule Learning for the Web of Data

N/A
N/A
Protected

Academic year: 2022

Partager "Logic-based Rule Learning for the Web of Data"

Copied!
2
0
0

Texte intégral

(1)

Logic-based Rule Learning for the Web of Data

Francesca A. Lisi

Dipartimento di Informatica &

Centro Interdipartimentale di Logica e Applicazioni (CILA) Universit`a degli Studi di Bari “Aldo Moro”, Italy

francesca.lisi@uniba.it

Abstract. This tutorial introduces to Inductive Logic Programming (ILP), being it a major logic-based approach to rule learning, and sur- veys extensions of ILP that turn out to be suitable for applications to the emerging vision of the Semantic Web as a Web of Data.

1 Outline of the tutorial

Rulesare widely used in Knowledge Engineering (KE) and Knowledge Represen- tation (KR) as a powerful way of modeling knowledge. However, the acquisition of rules for very large Knowledge Bases (KBs) still remains a very demanding KE activity. A partial automation of the rule authoring task,e.g., by applying Rule Learning algorithms [1], can be of help even though the automatically pro- duced rules are not guaranteed to be correct. A major logic-based approach to Rule Learning is that bunch of techniques collectively known under the name of Inductive Logic Programming (ILP) [2,3,4]. ILP has been historically concerned with Rule Learning from examples and background knowledge within the KR framework of Horn rules and with the aim of prediction (see, e.g., the system Foil [5]). However, ILP has also been applied to tasks - such as association rule mining - other than classification where the scope of induction is descrip- tion rathen than prediction. A notable example of this kind of ILP systems is Warmr[6].

New challenges to Rule Learning come from the emerging vision of the Se- mantic Web as aWeb of Data. In particular, when applying ILP to data on the Web, two key issues are the incompleteness and the imprecision of this data.

Incompleteness is naturally treated under theOpen World Assumption (OWA) as opposed to databases and (I)LP for which the Closed World Assumption (CWA) holds. The OWA indeed underlies many Semantic Web languages such as RDF, RDF(S), and OWL. The semantic mismatch between OWA and CWA is elegantly overcome by so-called hybrid KR formalisms that integrate LP and Description Logics (DLs) (see, e.g., [7] for a survey). One of these formalisms is the KR choice in AL-QuIn [8], an ILP system inspired by Warmr, which supports the descriptive task of association rule mining in the new context of the Semantic Web. Imprecision is a weak form of vagueness, not to be mistaken for uncertainty, which is often formalized with fuzzy set theory. In order to deal with vagueness in the Semantic Web context several fuzzy extensions of DLs

(2)

have been proposed (see,e.g., [9] for a recent overview). The ILP systemFoil- DL[10] is an adaptation of Foilto the novel case of learning fuzzy DL axioms where the axioms are in a form easily traducible into rules and fuzzification involves numerical properties of the data.

References

1. F¨urnkranz, J., Gamberger, D., Lavraˇc, N.: Foundations of Rule Learning. Springer (2012)

2. Muggleton, S.H.: Inductive logic programming. In Arikawa, S., Goto, S., Ohsuga, S., Yokomori, T., eds.: Proceedings of the 1st Conference on Algorithmic Learning Theory, Springer/Ohmsma (1990)

3. Nienhuys-Cheng, S.H., de Wolf, R.: Foundations of Inductive Logic Programming.

Volume 1228 of Lecture Notes in Artificial Intelligence. Springer (1997) 4. De Raedt, L.: Logical and Relational Learning. Springer (2008)

5. Quinlan, J.R.: Learning logical definitions from relations. Machine Learning 5 (1990) 239–266

6. Dehaspe, L., Toivonen, H.: Discovery of frequentDatalogpatterns. Data Mining and Knowledge Discovery 3(1999) 7–36

7. Drabent, W., Eiter, T., Ianni, G., Krennwallner, T., Lukasiewicz, T., Maluszynski, J.: Hybrid Reasoning with Rules and Ontologies. In Bry, F., Maluszynski, J., eds.:

Semantic Techniques for the Web, The REWERSE Perspective. Volume 5500 of Lecture Notes in Computer Science. Springer (2009) 1–49

8. Lisi, F.A.: AL-QuIn: An Onto-Relational Learning System for Semantic Web Mining. International Journal on Semantic Web and Information Systems 7(3) (2011) 1–22

9. Straccia, U.: All about fuzzy description logics and applications. In Faber, W., Paschke, A., eds.: Reasoning Web. Web Logic Rules - 11th International Summer School 2015, Berlin, Germany, July 31 - August 4, 2015, Tutorial Lectures. Volume 9203 of Lecture Notes in Computer Science., Springer (2015) 1–31

10. Lisi, F.A., Straccia, U.: Learning in description logics with fuzzy concrete domains.

Fundamenta Informaticae140(3-4) (2015) 373–391

Références

Documents relatifs

Static rule-based classification produces models that can be described by means of propositional logic-like rules; here, we propose an algorithm that is able to extract an

Inductive Logic Programming (ILP) [35] is considered as the major logic-based (thus, model-based) approach to learning and mining rules from structured data.. Originally focused on

We also propose and implement an algorithm, called Parameter learning for HIerarchical probabilistic Logic program (PHIL) 3 that learns the parameter of HPLP using EM and

P-SHIQ(D) uses probabilistic lexico- graphic entailment from probabilistic default reasoning and allows to annotate with a probabilistic interval both assertional and

In what follows we present the abductive representation used by XHAIL for computing inductive solutions and the statistical abduction for com- puting a probability distribution

In particular, we investigate the use of inductive logic programming (ILP) to con- duct two types of analyses: (i) identifying factors that are associated with and can

This processing includes: syntactical analysis of sentences using the constraint grammar Palavras [3]; semantical analysis using discourse representation theory [5]; and,

An extended abduc- tive logic program ET is made up of a triple hP, A, T P ICi, where P is a stan- dard logic program, A (Abducibles) is a set of predicate names and T P IC