Feb 19, 2012 · Abstract:We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order ...

We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature ...

Abstract. We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-.

This work investigates the size of rewritings of conjunctive queries over OWL2QL ontologies of depth 1 and 2 by means of a new hypergraph formalism for ...

We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog ...

We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature ...

On the succinctness of query rewriting over shallow ontologies · The price of query rewriting in ontology-based data access · On the succinctness of query ...

Bibliographic details on Exponential Lower Bounds and Separation for Query Rewriting.

Bibliographic details on Exponential Lower Bounds and Separation for Query Rewriting.

Exponential lower bounds and separation for query rewriting. S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev. International Colloquium on Automata ...