Circuit Complexity Meets Ontology-Based Data Access (Q3194705)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Circuit Complexity Meets Ontology-Based Data Access	scientific article

Statements

scholarly article

0 references

Circuit Complexity Meets Ontology-Based Data Access (English)

0 references

Lecture Notes in Computer Science

0 references

publication date

20 October 2015

0 references

full work available at URL

https://arxiv.org/abs/1506.01296

0 references

Vladimir V. Podolskii

0 references

MaRDI profile type

MaRDI publication profile

0 references

The monotone circuit complexity of Boolean functions

0 references

The DL-Lite Family and Relations

0 references

Towards more expressive ontology languages: the query answering problem

0 references

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

0 references

The price of query rewriting in ontology-based data access

0 references

Boolean function complexity. Advances and frontiers.

0 references

Monotone Circuits for Connectivity Require Super-Logarithmic Depth

0 references

Exponential Lower Bounds and Separation for Query Rewriting

0 references

On the succinctness of query rewriting over shallow ontologies

0 references

Linking Data to Ontologies

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-20297-6_2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3194705

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3194705&oldid=36207712"