nach oben

Erschienen in:

2015 | OriginalPaper | Buchkapitel

Recent Advances in Datalog\(^\pm \)

verfasst von : Georg Gottlob, Michael Morak, Andreas Pieris

Erschienen in: Reasoning Web. Web Logic Rules

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

This tutorial, which is a continuation of the tutorial “Datalog and Its Extensions for Semantic Web Databases” presented in the Reasoning Web 2012 Summer School, discusses recent advances in the Datalog\(^\pm \) family of languages for knowledge representation and reasoning. These languages extend plain Datalog with key modeling features such as existential quantification (signified by the “+” symbol), and at the same time apply syntactic restrictions to achieve decidability of ontological reasoning and, in some relevant cases, also tractability (signified by the symbol “\(-\)”). In this tutorial, we first introduce the main Datalog\(^\pm \) languages that are based on the well-known notion of guardedness. Then, we discuss how these languages can be extended with important features such as disjunction and default negation.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel The Power of Semantic Rules in Rulelog: Fundamentals and Recent Progress (Extended Abstract of Tutorial Presentation)

Nächstes Kapitel Ontology-Mediated Query Answering with Data-Tractable Description Logics

Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)MATH

Alviano, M., Faber, W., Leone, N., Manna, M.: Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues. TPLP 12(4–5), 701–718 (2012)MathSciNetMATH

Alviano, M., Pieris, A.: Default negation for non-guarded existential rules. In: PODS (2015, to appear)

Andréka, H., Németi, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. J. Philos. Logic 27(3), 217–274 (1998)MathSciNetCrossRefMATH

Arenas, M., Gottlob, G., Pieris, A.: Expressive languages for querying the semantic web. In: PODS, pp. 14–26 (2014)

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)MATH

Baget, J.F., Leclère, M., Mugnier, M.L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artif. Intell. 175(9–10), 1620–1654 (2011)MathSciNetCrossRefMATH

Baget, J., Garreau, F., Mugnier, M., Rocher, S.: Extending acyclicity notions for existential rules. In: ECAI, pp. 39–44 (2014)

Bárány, V., Gottlob, G., Otto, M.: Querying the guarded fragment. Log. Meth. Comput. Sci. 10(2) (2014)

10.

Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: ICALP, pp. 73–85 (1981)

11.

Bourhis, P., Morak, M., Pieris, A.: The impact of disjunction on query answering under guarded-based existential rules. In: IJCAI (2013)

12.

Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. J. Artif. Intell. Res. 48, 115–174 (2013)MathSciNetMATH

13.

Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Sem. 14, 57–83 (2012)CrossRef

14.

Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog\(^\pm \): A family of logical knowledge representation and query languages for new applications. In: LICS, pp. 228–242 (2010)

15.

Calì, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: The query answering problem. Artif. Intell. 193, 87–128 (2012)MathSciNetCrossRefMATH

16.

Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)MathSciNetCrossRefMATH

17.

Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell. 195, 335–360 (2013)MathSciNetCrossRefMATH

18.

Casanova, M.A., Fagin, R., Papadimitriou, C.H.: Inclusion dependencies and their interaction with functional dependencies. J. Comput. Syst. Sci. 28(1), 29–59 (1984)MathSciNetCrossRefMATH

19.

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

20.

Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)MathSciNetCrossRefMATH

21.

Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002) CrossRef

22.

Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. Database Syst. 22(3), 364–418 (1997)CrossRef

23.

Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for non-monotonic reasoning. In: LPNMR, pp. 364–375 (1997)

24.

Eiter, T., Simkus, M.: FDNC: decidable nonmonotonic disjunctive logic programs with function symbols. ACM Trans. Comput. Log., 11(2) (2010)

25.

Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: The potsdam answer set solving collection. AI Commun. 24(2), 107–124 (2011)MathSciNetMATH

26.

Gottlob, G., Hernich, A., Kupke, C., Lukasiewicz, T.: Stable model semantics for guarded existential rules and description logics. In: KR

27.

Gottlob, G., Hernich, A., Kupke, C., Lukasiewicz, T.: Equality-friendly well-founded semantics and applications to description logics. In: AAAI (2012)

28.

Gottlob, G., Manna, M., Morak, M., Pieris, A.: On the complexity of ontological reasoning under disjunctive existential rules. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 1–18. Springer, Heidelberg (2012) CrossRef

29.

Gottlob, G., Orsi, G., Pieris, A., Šimkus, M.: Datalog and its extensions for semantic web databases. In: Eiter, T., Krennwallner, T. (eds.) Reasoning Web 2012. LNCS, vol. 7487, pp. 54–77. Springer, Heidelberg (2012)

30.

Grädel, E.: On the restraining power of guards. J. Symbolic Logic 64(4), 1719–1742 (1999)MathSciNetCrossRefMATH

31.

Hernich, A., Kupke, C., Lukasiewicz, T., Gottlob, G.: Well-founded semantics for extended datalog and ontological reasoning. In: PODS, pp. 225–236 (2013)

32.

Lloyd, J.W.: Foundations of Logic Programming. Springer, New York (1987) CrossRefMATH

33.

Magka, D., Krötzsch, M., Horrocks, I.: Computing stable models for nonmonotonic existential rules. In: IJCAI (2013)

34.

Morak, M.: The Impact of Disjunction on Reasoning under Existential Rules. Ph.D. Thesis, University of Oxford, Oxford, Oxfordshire, UK (2015)

35.

Patel-Schneider, P.F., Horrocks, I.: A comparison of two modelling paradigms in the semantic web. J. Web Sem. 5(4), 240–250 (2007)CrossRef

36.

Vardi, M.Y.: On the complexity of bounded-variable queries. In: PODS, pp. 266–276 (1995)

Titel: Recent Advances in Datalog
verfasst von: Georg Gottlob
Michael Morak
Andreas Pieris
Verlag: Springer International Publishing
Buch: Reasoning Web. Web Logic Rules
Print ISBN: 978-3-319-21767-3

Electronic ISBN: 978-3-319-21768-0

Copyright-Jahr: 2015
DOI: https://doi.org/10.1007/978-3-319-21768-0_8

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner