Skip to search formSkip to main contentSkip to account menu
Contextualized knowledge repositories for the Semantic Web
View via Publisher
Dynamic Logic Programming: Various Semantics Are Equal on Acyclic Programs
TLDR
It is shown that for a MDLP $\mathcal{P}$ and a candidate model M, if $P is acyclic to some extent then several of the known semantics coincide on M, and it follows as a direct consequence that on the class of acYclic programs all of these semantics coincide.
View via Publisher
Taking Advantage of Web 2.0 in Organized Education (A Survey)
TLDR
The blended learning approach seems to be the most effective way to include these activities in higher education and these tools bring a particular value into those fields of study where open ended discussion and competing opinions are valued.
Metamodeling-Based Coherence Checking of OWL Vocabulary Background Models
TLDR
This work presents an alternative type of back- ground model language, dubbed PURO, which is oriented towards linked data on- tologies, and relies on particular-universal and relationship-object dichotomies.
View Paper
Towards Typed Higher-Order Description Logics
We introduce a typed higher-order description logic specifically intended for reasoning about ontological coherence of domain models, motivated by a practical use case from linked data vocabularies.
View Paper
Modeling Contextualized Knowledge
TLDR
This paper proposes a modeling exercise with one of the paradigms, tools and languages proposed with the aim of adding context awareness into the Semantic Web, for which the contextualized knowledge repository is chosen.
View Paper
Distributed Description Logics Revisited
TLDR
The original semantics of DDLs is modified in order to cope with a modeling discrepancy that has been pointed out in the literature, and a new kind of bridge rules are introduced, which are called conjunctive.
View Paper
Towards Formal Comparison of Ontology Linking, Mapping and Importing
TLDR
This work aims towards formal comparison of the expressive power of these frameworks, and thus also the ontology combination paradigms that they instantiate, and presents two new reductions from P-DL to DDL and vice versa.
View Paper
Typed Higher-Order Variant of SROIQ - Why Not?
We provideTH(SROIQ) a typed higher-order extension ofSROIQ, that is itself a syntactic variant of SROIQ, i.e., it is polynomially reducible into it. We also discuss modelling scenarios in which such…
View Paper
Tableau-Based ABox Abduction for the ALCHO Description Logic
TLDR
This work develops an ABox abduction algorithm for the ALCHO DL, that is based on Reiter’s minimal hitting set algorithm, and focuses on the class of explanations allowing atomic and negated atomic concept assertions, role assertions, andNegated role assertions.
View Paper
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License