scientific article
From MaRDI portal
Publication:3624113
zbMath1183.68244arXiv1111.0049MaRDI QIDQ3624113
No author found.
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1111.0049
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Data-complexity of the two-variable fragment with counting quantifiers ⋮ Combining answer set programming with description logics for the semantic web ⋮ On the relation between SPARQL1.1 and Answer Set Programming ⋮ Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies ⋮ View-based query answering in description logics: semantics and complexity ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ ⋮ Cheap Boolean Role Constructors for Description Logics ⋮ Modal definability of first-order formulas with free variables and query answering ⋮ The Complexity of Conjunctive Query Answering in Expressive Description Logics ⋮ Foundations of Onto-Relational Learning ⋮ Data complexity of query answering in expressive description logics via tableaux ⋮ Reasoning and Query Answering in Description Logics ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ Optimized Query Rewriting for OWL 2 QL ⋮ Formal Properties of Modularisation ⋮ Query Answering in Description Logics: The Knots Approach ⋮ Description Logics ⋮ Query Answering with DBoxes is Hard ⋮ Exploiting conjunctive queries in description logic programs ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ On the scalability of description logic instance retrieval ⋮ Hybrid Logics and Ontology Languages ⋮ \({\mathcal E}\)-connections of abstract description systems
Uses Software
This page was built for publication:
