No article text was recorded for this version.
representation size explosion
Version 2 of 260 papers74 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
- Blog: Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
- Blog: Translating First-Order Theories into Logic Programs
- Blog: Backdoors to Normality for Disjunctive Logic Programs
- Blog: Knowledge Compilation in the Modal Logic S5
- Blog: Tractable Explanations for d-DNNF Classifiers
- Blog: Embedding Intuitionistic into Classical Logic
- Blog: A Model-Theoretic Counterpart of Loop Formulas
- Blog: Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases
- Blog: The Comparative Linguistics of Knowledge Representation
- Blog: A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem
- Blog: On the Universal and Existential Fragments of the μ-Calculus
- Blog: SMT-based weighted model integration with structure awareness
- Blog: Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions
- Blog: A SAT-Based Approach for Mining Association Rules
- Blog: Minimization of Visibly Pushdown Automata Using Partial Max-SAT
- Blog: A characterization of efficiently compilable constraint languages
- Blog: The Logic Behind Weighted CSP
- Blog: Forming Concepts for Fast Inference
- Blog: Evaluation Techniques and Systems for Answer Set Programming: a Survey
- Blog: Combining Existential Rules and Description Logics
- Blog: Knowledge Compilation Using Theory Prime Implicates
- Blog: Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
- Blog: Even Faster Conflicts and Lazier Reductions for String Solvers
- Blog: Translating between Horn Representations and their Characteristic Models
- Blog: SMT Techniques for Fast Predicate Abstraction
- Blog: Counting Answer Sets of Disjunctive Answer Set Programs
- Blog: Incremental Algorithms for Approximate Compilation
- Blog: Bringing Order to Chaos - A Compact Representation of Partial Order in SAT-Based HTN Planning
- Blog: Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
- Blog: A MaxSAT-Based Framework for Group Testing
- Blog: A SAT-based Method for Solving the Two-dimensional Strip Packing Problem
- Blog: Lower Bounds for Approximate Knowledge Compilation
- Blog: Automatically Verifying Expressive Epistemic Properties of Programs
- Blog: Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints
- Blog: Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems
- Blog: Embedding Symbolic Knowledge into Deep Networks
- Blog: SEM: a System for Enumerating Models
- Blog: A Compiler for Deterministic, Decomposable Negation Normal Form
- Blog: Classical Generalized Probabilistic Satisfiability
- Blog: Compilation of Propositional Weighted Bases
- Blog: Efficient Evaluation of Answer Set Programs with External Sources Based on External Source Inlining
- Blog: Qualitative CSP, Finite CSP, and SAT: Comparing Methods for Qualitative Constraint-based Reasoning
- Blog: Generation of Hard Non-Clausal Random Satisfiability Problems
- Blog: Improving First-order Model Searching by Propositional Reasoning and Lemma Learning
- Blog: ModGen: Theorem Proving by Model Generation
- Blog: Semantical and Computational Aspects of Horn Approximations
- Blog: Conjunctive Representations in Contingent Planning: Prime Implicates Versus Minimal CNF Formula
- Blog: Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
- Blog: Sampling Techniques for Boolean Satisfiability
- Blog: Approximate Knowledge Compilation by Online Collapsed Importance Sampling
- Blog: Compile!
- Blog: Property Persistence in the Situation Calculus
- Blog: The UCLID Decision Procedure
- Blog: On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic
- Blog: Expressive Equivalence Between Decidable Freeze and Metric Timed Temporal Logics
- Blog: Lean-Auto: An Interface Between Lean 4 and Automated Theorem Provers
- Blog: NON NONMONOTONIC REASONING 5
- Blog: Solving Advanced Argumentation Problems with Answer-Set Programming
- Blog: A Top-Down Compiler for Sentential Decision Diagrams
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_representation_size_explosion_3b17527b,
title = {representation size explosion},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/representation-size-explosion/rdr_3b17527b4fd644ae9db969df3e2285ab},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_representation_size_explosion_3b17527b_v2,
title = {representation size explosion},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/representation-size-explosion/rdr_3b17527b4fd644ae9db969df3e2285ab/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}