, 1, we know that any d-SDNNF for ?(Q, I ) has size 2 ? tw(H) for some constant ? > 0 (depending only on the arity and degree bounds on I given above, which depend only on Q), which by Lemma 4.8.7 is 2 ?tw(I ) for a different constant ? > 0 and tw(I ) large enough. By definition of S k , we obtain the lower bound of 2 ?f (k) for k large enough. Now, to conclude, we must show that this lower bound also applies to any d-SDNNF for ?(Q, I)
Evaluating Datalog via Tree Automata and Cycluits, Theory of Computing Systems, p.57, 2018. ,
DOI : 10.1007/s00224-018-9901-2
URL : https://hal.archives-ouvertes.fr/hal-01891814
, Peer-Reviewed Conference Articles
Combined Tractability of Query Evaluation via Tree Automata and Cycluits, ICDT (cit. on pp. 57, vol.64, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01439294
Challenges for Efficient Query Evaluation on Structured Probabilistic Data, SUM (cit, p.144, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01360167
, Conjunctive Queries on Probabilistic Graphs: Combined Complexity". In: PODS (cit, p.31, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01486634
, Connecting Width and Structure in Knowledge Compilation". In: ICDT (cit, p.107, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01851564
, Peer-Reviewed Workshop Articles
Probabilistic Evaluation of Expressive Queries on BoundedTreewidth Instances, SIGMOD/PODS PhD Symposium, p.144, 2016. ,
Towards Deterministic Decomposable Circuits for Safe Queries, vol.141, p.12, 2018. ,
Foundations of Databases, 1995. ,
The Design and Analysis of Computer Algorithms, p.19, 1974. ,
Finding and Counting Given Length Cycles, Algorithmica (cit, p.59, 1997. ,
The Possibility Problem for Probabilistic XML, p.143, 2014. ,
DOI : 10.3166/isi.20.5.53-75
URL : https://hal.archives-ouvertes.fr/hal-01190712
Leveraging the Structure of Uncertain Data, vol.89, pp.125-127, 2016. ,
URL : https://hal.archives-ouvertes.fr/tel-01345836
A Circuit-Based Approach to Efficient Enumeration, ICALP (cit. on pp. 9, vol.28, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01639179
, Provenance Circuits for Trees and Treelike Instances". In: ICALP (cit. on pp. 2-4, vol.148, pp.151-154, 2015.
DOI : 10.1007/978-3-662-47666-6_5
URL : https://hal.archives-ouvertes.fr/hal-01178399
, Tractable Lineages on Treelike Instances: Limits and Extensions". In: PODS (cit. on pp. 9, vol.10, pp.133-135, 2016.
DOI : 10.1145/2902251.2902301
URL : https://hal.archives-ouvertes.fr/hal-01336514
Complexity of Finding Embeddings in a k-tree, SIAM Journal on Algebraic and Discrete Methods (cit, p.23, 1987. ,
DOI : 10.1137/0608024
The Implication Problem for Functional and Inclusion Dependencies is Undecidable, SIAM Journal on Computing, p.74, 1985. ,
DOI : 10.1137/0214049
Predicting Protein Complex Membership Using Probabilistic Network Reliability, Genome Research, 2004. ,
DOI : 10.1101/gr.2203804
URL : http://genome.cshlp.org/content/14/6/1170.full.pdf
, Predicting Learnt Clauses Quality in Modern SAT Solvers". In: IJCAI (cit, p.11, 2009.
Queries with Guarded Negation, PVLDB (cit, p.74, 2012. ,
Guarded Negation, Journal of the ACM (cit, vol.74, p.73, 2015. ,
The Management of Probabilistic Data, IEEE Transactions on Knowledge and Data Engineering, 1992. ,
Querying Graph Databases, PODS (cit. on pp. 7, 17, vol.58, p.76, 2013. ,
Does Query Evaluation Tractability Help Query Containment?, In: PODS (cit. on pp. 7, 58, vol.152, p.76, 2014. ,
Exact Model Counting of Query Expressions: Limitations of Propositional Methods, ACM Transactions on Database Systems, p.11, 2017. ,
, New Limits for Knowledge Compilation and Applications to Exact Model Counting". In: UAI (cit, p.109, 2015.
Symmetric Weighted First-order Model Counting, 2015. ,
DOI : 10.1145/2745754.2745760
URL : http://arxiv.org/pdf/1412.1505
, Monadic Datalog Containment". In: ICALP (cit, p.64, 2012.
DOI : 10.1007/978-3-642-31585-5_11
URL : https://hal.archives-ouvertes.fr/hal-00809306
A Step Up in Expressiveness of Decidable Fixpoint Logics, LICS (cit. on pp. 7, 58, vol.152, p.74, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01413890
Effective Interpolation and Preservation in Guarded Logics, LICS (cit, vol.74, p.73, 2014. ,
The Impact of Virtual Views on Containment, PVLDB (cit, p.69, 2010. ,
, XPath Leashed". In: ACM Computing Surveys, p.143, 2009.
An Introduction to Clique Minimal Separator Decomposition". In: Algorithms (cit, p.65, 2010. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00485851
Games and Model Checking for Guarded Logics, LPAR (cit. on pp. 60, vol.74, p.70, 2001. ,
State-Complexity of Finite-State Devices, State Compressibility and Incompressibility, Mathematical systems theory, p.63, 1993. ,
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal of Computing, vol.110, p.23, 1996. ,
, Treewidth Computations I. Upper Bounds". In: Information and Computation, p.98, 2010.
SDDs are Exponentially More Succinct than OBDDs, AAAI (cit, p.143, 2016. ,
A Strongly Exponential Separation of DNNFs from CNF Formulas, CoRR (cit, p.124, 2015. ,
Knowledge Compilation Meets Communication Complexity, IJCAI (cit. on pp. 10, vol.109, pp.130-132, 2016. ,
On Compiling Structured CNFs to OBDDs, CSR (cit, p.129, 2015. ,
On Compiling Structured CNFs to OBDDs, Theoretical Computer Science, 2017. ,
Circuit Treewidth, Sentential Decision, and Query Compilation, 2017. ,
DOI : 10.1145/3034786.3034787
URL : http://arxiv.org/pdf/1701.04626
, Hypergraph Acyclicity Revisited". In: ArXiv e-prints, p.47, 2014.
Understanding Model Counting for ?-Acyclic CNF-Formulas, STACS (cit. on pp. 6, vol.33, pp.47-49, 2015. ,
Symbolic Boolean Manipulation with Ordered BinaryDecision Diagrams, ACM Computing Surveys, vol.153, p.9, 1992. ,
The Complexity of the Counting Constraint Satisfaction Problem, Journal of the ACM (cit. on p, vol.32, 2013. ,
Two-Way Tree Automata Solving Pushdown Games, Automata Logics, and Infinite Games (cit. on pp. 63, vol.101, p.79, 2002. ,
DOI : 10.1007/3-540-36387-4_17
URL : https://hal.archives-ouvertes.fr/hal-00019914
Non-FPT Lower Bounds for Structural Restrictions of Decision DNNF, CoRR (cit, p.109, 2017. ,
, Containment of Conjunctive Regular Path Queries with Inverse". In: KR (cit, vol.76, p.17, 2000.
Structural Restrictions of CNF-Formulas: Applications to Model Counting and Knowledge Compilation, 2016. ,
Understanding the Complexity of #SAT Using Knowledge Compilation, LICS (cit, vol.130, p.109, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01836195
Passive Dendrites Enable Single Neurons to Compute Linearly Non-separable Functions, PLOS Computational Biology. Code, p.11, 2013. ,
Open-World Probabilistic Databases, KR (cit, p.31, 2016. ,
Polynomial Bounds for the Grid-Minor Theorem, STOC (cit, vol.143, p.135, 2014. ,
A Relational Model of Data for Large Shared Data Banks, Communications of the ACM, 1970. ,
Running Tree Automata on Probabilistic XML, 2009. ,
, Tree Automata: Techniques and Applications, 2007.
The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs, Information and Computation (cit. on pp. 6, 7, 57, vol.60, p.151, 1990. ,
URL : https://hal.archives-ouvertes.fr/hal-00353765
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover-Number Counts, FOCS (cit, p.32, 2014. ,
Efficient Query Evaluation on Probabilistic Databases, VLDB Journal, 2007. ,
The Dichotomy of Probabilistic Inference for Unions of Conjunctive Queries, Journal of the ACM, 2012. ,
Complexity and expressive power of logic programming, Comput. Surv, p.83, 2001. ,
On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision, Journal of Applied Non-Classical Logics (cit. on pp. 9, vol.54, 2001. ,
A Differential Approach to Inference in Bayesian Networks, Journal of the ACM (cit. on p, vol.113, 2003. ,
SDD: A New Canonical Representation of Propositional Knowledge Bases, IJCAI (cit, p.143, 2011. ,
Circuits for Datalog Provenance, In: ICDT (cit. on pp, vol.27, 2014. ,
Comparing Two-Level and Ordered Binary Decision Diagram Representations of Logic Functions, IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, 1993. ,
Simplicial Decompositions of Graphs: a Survey of Applications, Discrete Mathematics, vol.75, p.64, 1989. ,
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae, J. Log. Program, p.83, 1984. ,
Fixed Parameter Tractability and Completeness, Complexity Theory: Current Research, 1992. ,
Spanners in Sparse Graphs, Journal of Computer and System Sciences, p.136, 2011. ,
Degrees of Acyclicity for Hypergraphs and Relational Database Schemes, Journal of the ACM, p.59, 1983. ,
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study Through Datalog and Group Theory, SIAM Journal on Computing, p.143, 1998. ,
, Treewidth in Verification: Local vs. Global". In: LPAR (cit, p.124, 2005.
Inference and Learning in Probabilistic Logic Programs Using Weighted Boolean Formulas, Theory and Practice of Logic Programming, 2015. ,
A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness, IEEE Transactions on Reliability, vol.35, issue.2, 1986. ,
Query Evaluation via TreeDecompositions, Journal of the ACM, 2002. ,
DOI : 10.1145/602220.602222
, Parameterized Complexity Theory, 2006.
Predicting Completeness in Knowledge Bases, WSDM (cit, p.144, 2017. ,
The Intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs, Journal of Combinatorial Theory, vol.98, p.65, 1974. ,
Datalog LITE: a Deductive Query Language with Linear Time Model Checking, ACM Transactions on Computational Logic, p.60, 2002. ,
Treewidth and Hypertree Width, Tractability: Practical Approaches to Hard Problems. Cambridge University Press. Chap. 1 (cit, p.59, 2014. ,
DOI : 10.1017/cbo9781139177801.002
URL : https://www.mat.unical.it/%7Eggreco/files/GottlobGrecoScarcello.pdf
Conjunctive Queries Over Trees, Journal of the ACM (cit, vol.50, p.33, 2006. ,
DOI : 10.1145/1131342.1131345
URL : http://arxiv.org/pdf/cs/0602004
, Hypertree Decompositions and Tractable Queries, p.59, 2002.
DOI : 10.1145/303976.303979
URL : http://arxiv.org/pdf/cs/9812022v1.pdf
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width, Journal of Computer and System Sciences, p.60, 2003. ,
Monadic Datalog Over Finite Structures of Bounded Treewidth, ACM Transactions on Computational Logic (cit. on pp, vol.57, p.61, 2010. ,
Guarded Fixed Point Logics and the Monadic Theory of Countable Trees, Theoretical of Computer Science (cit, p.74, 2002. ,
Models for Incomplete and Probabilistic Information, 2006. ,
, Provenance Semirings". In: PODS (cit. on pp, vol.27, 2007.
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side, Journal of the ACM, p.32, 2007. ,
On Tree Width, Bramble Size, and Expansion, Journal of Combinatorial Theory, p.124, 2009. ,
DOI : 10.1016/j.jctb.2008.06.004
URL : https://doi.org/10.1016/j.jctb.2008.06.004
Constraint Solving via Fractional Edge Covers, TALG (cit, p.59, 2014. ,
DOI : 10.1145/2636918
URL : http://arxiv.org/pdf/1711.04506
Polynomial GraphColorings, Discrete Applied Mathematics (cit. on pp, vol.6, p.33, 1992. ,
The Number of Caterpillars, Discrete Mathematics, p.142, 1973. ,
DOI : 10.1016/0012-365x(73)90067-8
URL : https://doi.org/10.1016/0012-365x(73)90067-8
Probabilistic Path Queries in Road Networks: Traffic Uncertainty Aware Path Selection, 2010. ,
DOI : 10.1145/1739041.1739084
MayBMS: a Probabilistic Database Management System, 2009. ,
Incomplete Information in Relational Databases, Journal of the ACM (cit. on pp, vol.80, p.27, 1984. ,
MCDB: a Monte Carlo Approach to Managing Uncertain Data, 2008. ,
Bridging the Gap Between Intensional and Extensional Query Evaluation in Probabilistic Databases, EDBT (cit. on pp. 9, vol.154, p.107, 2010. ,
Knowledge Compilation Meets Database Theory: Compiling Queries to Decision Diagrams, ICDT (cit. on pp. 9, vol.154, p.107, 2011. ,
On the Tractability of Query Compilation and Bounded Treewidth, ICDT (cit. on pp. 9, vol.107, 2012. ,
Knowledge Compilation Meets Database Theory: Compiling Queries to Decision Diagrams, Theory of Computing Systems, p.11, 2013. ,
DOI : 10.1007/s00224-012-9392-5
URL : http://www.cs.washington.edu/homes/suciu/camera_ready.pdf
, Queries with Difference on Probabilistic Databases". In: PVLDB (cit, p.37, 2011.
Probabilistic XML: Models and Complexity, Advances in Probabilistic Databases for Uncertain Information Management, vol.144, p.32, 2013. ,
DOI : 10.1007/978-3-642-37509-5_3
URL : https://hal.archives-ouvertes.fr/hal-00874441
ProbView: A Flexible Probabilistic Database System, ACM Transactions on Database Systems, p.1, 1997. ,
Local Computations with Probabilities on Graphical Structures and their Application to Expert Systems, Journal of the Royal Statistical Society (cit. on pp, vol.9, 1988. ,
Optimal Decomposition by Clique Separators, Discrete Mathematics, p.65, 1993. ,
DOI : 10.1016/0012-365x(93)90510-z
URL : https://doi.org/10.1016/0012-365x(93)90510-z
The Semijoin Algebra and the Guarded Fragment, Journal of Logic, Language and Information, p.59, 2005. ,
Analysis of Cyclic Combinational Circuits, ICCAD (cit, p.59, 1993. ,
An Indexing Framework for Queries on Probabilistic Graphs, ACM Transactions on Database Systems, p.144, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01437580
Circumference and Pathwidth of Highly Connected Graphs, Journal of Graph Theory, p.109, 2014. ,
Finding Regular Simple Paths in Graph Databases, VLDB (cit, p.76, 1989. ,
Weak Monadic Second Order Theory of Succesor is not Elementary-Recursive, Logic Colloquium, 1975. ,
The Implication Problem for Functional and Inclusion Dependencies, Information and Control, p.74, 1983. ,
Exploring Graph Parameters Similar to TreeWidth and Path-Width, p.125, 2017. ,
On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs, IEICE Transactions on Fundamentals of Electronics, 2014. ,
New Compilation Languages Based on Structured Decomposability, AAAI (cit. on pp. 9, vol.154, p.28, 2008. ,
A Lower Bound on the Size of Decomposable Negation Normal Form, AAAI (cit. on pp. 109, vol.130, 2010. ,
, The Complexity of Counting Cuts and of Computing the Probability That a Graph is Connected, SIAM Journal of Computing, p.43, 1983.
On OBDDs for CNFs of Bounded Treewidth, 2014. ,
Efficient Top-k Query Evaluation on Probabilistic Data, 2007. ,
Materialized Views in Probabilistic Databases: For Information Exchange and Query Optimization, 2007. ,
Cyclic Boolean Circuits, Discrete Applied Mathematics (cit. on pp, vol.59, 2012. ,
Graph Minors. III. Planar TreeWidth, Journal of Combinatorial Theory, p.21, 1984. ,
Graph Minors. II. Algorithmic Aspects of Tree-Width, Journal of Algorithms, p.57, 1986. ,
Graph Minors. X. Obstructions to Tree-Decomposition, Journal of Combinatorial Theory, p.130, 1991. ,
Ordered Sets. An Introduction with Connections from Combinatorics to Topology. Birkhäuser (cit, vol.40, p.33, 2016. ,
Communication Complexity Theory: Thirty-Five Years of Set Disjointness, MFCS (cit, p.133, 2014. ,
Enumerative Combinatorics, p.40, 1997. ,
Counting Inequivalent Monotone Boolean Functions, Discrete Applied Mathematics, p.11, 2014. ,
Probabilistic Databases. Morgan & Claypool (cit, vol.18, pp.145-147, 2011. ,
Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, p.84, 1972. ,
Decomposition by Clique Separators, Discrete Mathematics, vol.55, 1985. ,
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs". In: SIAM Journal on computing, p.63, 1984. ,
A Lattice-Theoretical Fixpoint Theorem and its Applications, In: Pacific Journal of Mathematics, p.81, 1955. ,
Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic, Mathematical Systems Theory, 1968. ,
Programming Techniques: Regular Expression Search Algorithm, Communications of the ACM, p.76, 1968. ,
The Complexity of Enumeration and Reliability Problems, SIAM Journal on Computing, 1979. ,
, The Complexity of Relational Query Languages". In: STOC (cit, p.57, 1982.
On the Complexity of Bounded-Variable Queries, PODS (cit, vol.60, p.35, 1995. ,
New Width Parameters of Graphs, p.130, 2012. ,
Algorithms for Acyclic Database Schemes, vol.57, p.147, 1981. ,