Connecting Width and Structure in Knowledge Compilation (Extended Version)

DOI10.4230/LIPIcs.ICDT.2018.6zbMath1489.68067arXiv1709.06188OpenAlexW2755376675MaRDI QIDQ3305349

Antoine Amarilli, Mikaël Monet, Pierre Senellart

Publication date: 6 August 2020

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

zbMATH Keywords

treewidthcircuitsknowledge compilationprobabilistic databases

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30) Data structures (68P05)

Related Items (1)

An Experimental Study of the Treewidth of Real-World Graph Data

Cites Work

• Unnamed Item
• Graph minors. X: Obstructions to tree-decomposition
• On compiling structured CNFs to OBDDs
• On tree width, bramble size, and expansion
• Probabilistic Databases
• A differential approach to inference in Bayesian networks
• Query evaluation via tree-decompositions
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Connecting Width and Structure in Knowledge Compilation (Extended Version)