Exponential Lower Bounds and Separation for Query Rewriting
- 1 January 2012
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
Other Versions
This publication has 10 references indexed in Scilit:
- Boolean Function ComplexityPublished by Springer Science and Business Media LLC ,2012
- Ontological queries: Rewriting and optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- The DL-Lite Family and RelationsJournal of Artificial Intelligence Research, 2009
- A general datalog-based framework for tractable query answering over ontologiesPublished by Association for Computing Machinery (ACM) ,2009
- Computational ComplexityPublished by Cambridge University Press (CUP) ,2009
- Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite FamilyJournal of Automated Reasoning, 2007
- Monotone circuits for matching require linear depthJournal of the ACM, 1992
- The monotone circuit complexity of boolean functionsCombinatorica, 1987
- Fast parallel matrix and GCD computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- On the Complexity of Derivation in Propositional CalculusPublished by Springer Science and Business Media LLC ,1970