No article text was recorded for this version.
succinctness-tractability trade-off
Version 2 of 248 papers65 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Knowledge Compilation Map for Ordered Real-Valued Decision Diagrams
- Blog: A Knowledge Compilation Map
- Blog: SDDs Are Exponentially More Succinct than OBDDs
- Blog: New Limits for Knowledge Compilation and Applications to Exact Model Counting
- Blog: New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Extended Abstract)
- Blog: Pseudo-Boolean Constraints from a Knowledge Representation Perspective
- Blog: Revisiting Graph Width Measures for CNF-Encodings
- Blog: Compile!
- Blog: The Comparative Linguistics of Knowledge Representation
- Blog: Structured d-DNNF Is Not Closed under Negation
- Blog: An And-Sum Circuit with Signed Edges That Is More Succinct than SDD
- Blog: A Top-Down Compiler for Sentential Decision Diagrams
- Blog: The Limits of Tractable Marginalization
- Blog: On the Role of Canonicity in Bottom-up Knowledge Compilation
- Blog: Fast Compilation of s-t Paths on a Graph for Counting and Enumeration
- Blog: Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs
- Blog: The Expressive Power of Ad-Hoc Constraints for Modelling CSPs
- Blog: A Theory of Formalisms for Representing Knowledge
- Blog: No Efficient Disjunction or Conjunction of Switch-Lists
- Blog: A Lower Bound on the Size of Decomposable Negation Normal Form
- Blog: On the Use of Partially Ordered Decision Graphs in Knowledge Compilation and Quantified Boolean Formulae
- Blog: A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
- Blog: On Compiling System Models for Faster and More Scalable Diagnosis
- Blog: Comparing the succinctness of monadic query languages over finite trees
- Blog: Knowledge Compilation Meets Logical Separability
- Blog: Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae
- Blog: Knowledge Compilation Properties of Trees-of-BDDs, Revisited
- Blog: Knowledge Compilation Using Theory Prime Implicates
- Blog: Knowledge Compilation Properties of Tree-of-BDDs
- Blog: New Compilation Languages Based on Structured Decomposability
- Blog: A generic approach to planning in the presence of incomplete information: Theory and implementation (Extended Abstract)
- Blog: On Valued Negation Normal Form Formulas
- Blog: Succinctness of Epistemic Languages
- Blog: An FPRAS for #nFBDD
- Blog: Knowledge compilation
- Blog: A Compiler for Weak Decomposable Negation Normal Form
- Blog: Compact Answers to Temporal Path Queries
- Blog: Efficient Evaluation of Answer Set Programs with External Sources Based on External Source Inlining
- Blog: Efficient Representations for the Modal Logic S5
- Blog: Conjunctive Representations in Contingent Planning: Prime Implicates Versus Minimal CNF Formula
- Blog: Switch-List Representations in a Knowledge Compilation Map
- Blog: Variable Shift SDD: A More Succinct Sentential Decision Diagram
- Blog: Efficient Representation of Adhoc Constraints
- Blog: CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
- Blog: Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)
- Blog: Probabilistic Knowledge-Based Programs
- Blog: Knowledge Compilation Meets Communication Complexity
- Blog: New Compilation Languages Based on Restricted Weak Decomposability
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_succinctness_tractability_trade_off_e03f3ae7,
title = {succinctness-tractability trade-off},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/succinctness-tractability-trade-off/rdr_e03f3ae7687d480d80f95eeac5fe4015},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_succinctness_tractability_trade_off_e03f3ae7_v2,
title = {succinctness-tractability trade-off},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/succinctness-tractability-trade-off/rdr_e03f3ae7687d480d80f95eeac5fe4015/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}