Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Explaining Black-Box Models Using Interpretable Surrogates Read chapter Read first chapter

2019 | OriginalPaper | Chapter

SPARQL Queries over Ontologies Under the Fixed-Domain Semantics

Authors : Sebastian Rudolph, Lukas Schweizer, Zhihao Yao

Published in: PRICAI 2019: Trends in Artificial Intelligence

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Fixed-domain reasoning over OWL ontologies is adequate in certain closed-world scenarios and has been shown to be both useful and feasible in practice. However, the reasoning modes hitherto supported by available tools do not include querying. We provide the formal foundations of querying under the fixed domain semantics, based on the principle of certain answers, and show how fixed-domain querying can be incorporated in existing reasoning methods using answer set programming (ASP).

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

inform now

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!

inform now

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!

inform now
previous chapter Identity Resolution in Ontology Based Data Access to Structured Data Sources
next chapter Augmenting an Answer Set Based Controlled Natural Language with Temporal Expressions
Footnotes
1
To ensure compatibility with their later usage in RDF and SPARQL, we silently presume that all these vocabulary elements are Internationalized Resource Identifiers (IRIs).
 
2
The original definition of \(\mathcal {SROIQ}\) contained more RBox axioms (expressing transitivity, (a)symmetry, (ir)reflexivity of roles), but these can be shown to be syntactic sugar. Moreover, the definition of \(\mathcal {SROIQ}\) contains so-called global restrictions which prevents certain axioms from occurring together. These complicated restrictions, while crucial for the decidability of classical reasoning in \(\mathcal {SROIQ}\) are not necessary for fixed-domain reasoning considered here, hence we omit them for the sake of brevity.
 
Literature
1.
Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: Proceedings of the 7th Symposium on Principles of Database Systems (PODS), pp. 254–263. ACM Press (1998)
2.
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)MATH
3.
4.
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)CrossRef
5.
6.
Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)CrossRef
7.
Calvanese, D.: Finite model reasoning in description logics. In: Proceedings of Description Logic Workshop, 1996. AAAI Technical Report, vol. WS-96-05, pp. 25–36. AAAI Press (1996)
8.
9.
Gaggl, S.A., Rudolph, S., Schweizer, L.: Fixed-domain reasoning for description logics. In: Proceedings of European Conference on AI (ECAI), 2016. Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 819–827. IOS Press (2016)
10.
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, San Rafael (2012)
11.
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)CrossRef
12.
Glimm, B., Horrocks, I., Motik, B., Stoilos, G., Wang, Z.: HermiT: an OWL 2 reasoner. J. Autom. Reason. 53(3), 245–269 (2014)CrossRef
13.
Hitzler, P., Krötzsch, M., Rudolph, S.: Foundations of Semantic Web Technologies. Chapman & Hall/CRC, Boca Raton (2009)CrossRef
14.
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\cal{SROIQ}\). In: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 57–67. AAAI Press (2006)
15.
Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of the 11th International Conference on Logic Programming (ICLP), pp. 23–37. MIT Press (1994)
16.
Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. Inf. Comput. 199(1–2), 132–171 (2005)MathSciNetCrossRef
17.
18.
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3–4), 241–273 (1999)MathSciNetCrossRef
19.
Polleres, A., Wallner, J.P.: On the relation between SPARQL1.1 and answer set programming. J. Appl. Non-Class. Logics 23(1–2), 159–212 (2013)MathSciNetCrossRef
20.
21.
22.
Rudolph, S.: Undecidability results for database-inspired reasoning problems in very expressive description logics. In: Proceedings of the 15th International Conference on the Principles of Knowledge Representation and Reasoning (KR), pp. 247–257. AAAI Press (2016)
23.
Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!. J. Artif. Intell. Res. 39, 429–481 (2010)MathSciNetCrossRef
24.
25.
Rudolph, S., Schweizer, L., Tirtarasa, S.: Wolpertinger: a fixed-domain reasoner. In: Proceedings of the 16th International Semantic Web Conference (ISWC), Posters & Demonstrations. CEUR, vol. 1963. CEUR-WS.org (2017)
26.
27.
28.
Sirin, E., Parsia, B., Grau, B.C., Kalyanpur, A., Katz, Y.: Pellet: a practical OWL-DL reasoner. J. Web Semant. 5(2), 51–53 (2007)CrossRef
29.
Steigmiller, A., Liebig, T., Glimm, B.: Konclude: system description. J. Web Semant. 27, 78–85 (2014)CrossRef
30.
31.
Metadata
Title
SPARQL Queries over Ontologies Under the Fixed-Domain Semantics
Authors
Sebastian Rudolph
Lukas Schweizer
Zhihao Yao
Copyright Year
2019
Book
PRICAI 2019: Trends in Artificial Intelligence

Print ISBN: 978-3-030-29907-1

Electronic ISBN: 978-3-030-29908-8

Copyright Year: 2019

DOI
https://doi.org/10.1007/978-3-030-29908-8_39

Premium Partner

    Image Credits