# Foundations of Semantic Web Technologies

@inproceedings{Hitzler2009FoundationsOS,
title={Foundations of Semantic Web Technologies},
author={Pascal Hitzler and Markus Kr{\"o}tzsch and Sebastian Rudolph},
year={2009}
}
• Published 2009
• Computer Science
With more substantial funding from research organizations and industry, numerous large-scale applications, and recently developed technologies, the Semantic Web is quickly emerging as a well-recognized and important area of computer science. While Semantic Web technologies are still rapidly evolving, Foundations of Semantic Web Technologies focuses on the established foundations in this area that have become relatively stable over time. It thoroughly covers basic introductions and intuitions… Expand
739 Citations

#### Topics from this paper

What's Happening in Semantic Web - ... and What FCA Could Have to Do with It
Some research challenges where Formal Concept Analysis (FCA) could contribute as a method are briefly listed, and some of the past FCA-related work on these issues are listed. Expand
Learning OWL Class Expressions
It is shown that methods from Inductive Logic Programming (ILP) are applicable to learning in description logic knowledge bases and provide foundations for the acquisition of OWL ontologies, in cases when extensional information is easily available, while corresponding intensional information is missing or not expressive enough to allow powerful reasoning over the ontology in a useful way. Expand
Semantic Web Portals: Design and Development Technologies and Tools
The results of the work prove that this idea of building a SWP for Finnish educational system is relevant and implementable and will bring benefits to a wide category of users both general public and the education professionals. Expand
Reasoning Methods in Semantic Web
• Computer Science
• 2018
Survey of reasoning methods over unranked languages on the logic layer of the semantic web stack, where function and predicate symbols do not have a fixed arity are presented. Expand
Acquisition of Terminological Knowledge from Social Networks in Description Logic
This document presents a technique for the acquisition of terminological knowledge from social networks and shows how OWL axioms, i.e., concept inclusions and role inclusions in DLs, can be obtained from social graphs in a sound and complete manner. Expand
Semantic Web Foundations for Representing, Reasoning, and Traversing Contextualized Knowledge Graphs
The foundations for representing, querying, reasoning and traversing the contextualized knowledge graphs (CKG) using Semantic Web technologies are presented and a principled approach and RDF triples about triples are constructed by extending the current RDF data model with a new concept, called singleton property (SP), as a triple identifier. Expand
Semantic Web Collaborative Spaces
• Lecture Notes in Computer Science
• 2013
The role that collaborative infrastructures can play in creating and maintaining Linked Data, and the benefits of exploiting knowledge represented in ontologies as well as the main features of Semantic Web technologies to effectively assess the LOD cloud’s evolution are described. Expand
State of the Art of Semantic Web
Semantic web is an attempt to provide technology, standards, and methodologies to structure and describe the meaning of data on the web, and to make it easier to process by machines. Thus, allowingExpand
A Language for Inconsistency-Tolerant Ontology Mapping
The research work presented in this dissertation, is driven by the goal of providing a robust ontology alignment language for the semantic web, as it shows that description logics based alignment languages are not suitable for aligning ontologies. Expand
On the Utility and Feasibility of Reasoning with Undecidable Semantic Web Formalisms
• Computer Science
• 2011
A way to establish incomplete – yet useful – reasoning support for undecidable formalisms by deploying machinery from the successful domain of theorem proving in first-order predicate logic is discussed. Expand

#### References

SHOWING 1-8 OF 8 REFERENCES
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
• Computer Science
• ECAI
• 2008
A well-founded semantics for such knowledge bases is proposed which promises to provide better efficiency of reasoning, which is compatible both with the OWL-based semantics and the traditional well- founded semantics for logic programs, and which surpasses previous proposals for such a well-formed semantics by avoiding some issues related to inconsistency handling. Expand
Reconciling description logics and rules
• Mathematics, Computer Science
• JACM
• 2008
A hybrid formalism of MKNF+ knowledge bases is presented, which integrates DLs and rules in a coherent semantic framework by basing the semantics of the formalism on the logic of minimal knowledge and negation as failure (MKNF) by Lifschitz. Expand
Query Answering for OWL-DL with rules
• Computer Science
• J. Web Semant.
• 2005
A decidable combination of OWL-DL and function-free Horn rules where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in therule body. Expand
Description Logic Rules
• Computer Science
• ECAI
• 2008
It is shown that the DL SROIQ --the basis for the ongoing standardisation of OWL 2 --can completely internalise DL rules, and DL rules enable us to significantly extend the tractable DLs EL++ and DLP. Expand
ELP: Tractable Rules for OWL 2
• Computer Science
• SEMWEB
• 2008
It is shown that DL-safe rules based on the Description Logic Programming (DLP) fragment of OWL 2 can be admitted in ELP without losing tractability. Expand
Cheap Boolean Role Constructors for Description Logics
• Computer Science
• JELIA
• 2008
It is shown that the expressive DLs $\mathcal{SHOIQ}$ and $\ mathcal{SROIQ]$, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. Expand
SELECT ?F11 ?F12 ?F13 ?F14 ?F21 ?F22 ?F23 ?F24 ?F31 ?F32 ?F33 ?F34 ?F41 ?F42 ?F43 ?F44
• SELECT ?F11 ?F12 ?F13 ?F14 ?F21 ?F22 ?F23 ?F24 ?F31 ?F32 ?F33 ?F34 ?F41 ?F42 ?F43 ?F44
ˆˆxsd:int ) FILTER( ?F24 = "4"ˆˆxsd:int ) FILTER( ?F31 = "2"ˆˆxsd:int ) FILTER( ?F41 = "3"ˆˆxsd:int ) FILTER( ?Fi != ?Fj )
• FILTER