Circuit Complexity Meets Ontology-Based Data Access

DOI10.1007/978-3-319-20297-6_2zbMath1464.68096arXiv1506.01296OpenAlexW2963541178MaRDI QIDQ3194705

Vladimir V. Podolskii

Publication date: 20 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.01296

Mathematics Subject Classification ID

Database theory (68P15) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

Bounds in ontology-based data access via circuit complexity ⋮ On translating Lambek grammars with one division into context-free grammars

Cites Work

• Towards more expressive ontology languages: the query answering problem
• Boolean function complexity. Advances and frontiers.
• The monotone circuit complexity of Boolean functions
• The price of query rewriting in ontology-based data access
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Exponential Lower Bounds and Separation for Query Rewriting
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• The DL-Lite Family and Relations
• On the succinctness of query rewriting over shallow ontologies
• Linking Data to Ontologies
• Unnamed Item

This page was built for publication: Circuit Complexity Meets Ontology-Based Data Access