Decomposable negation normal form
From MaRDI portal
Publication:5441353
DOI10.1145/502090.502091zbMath1127.03321MaRDI QIDQ5441353
Publication date: 11 February 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/502090.502091
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
03B35: Mechanization of proofs and logical operations
Related Items
Recursive conditioning, Compiling propositional weighted bases, Some computational aspects of DISTANCE SAT, Efficient query processing with reduced implicate tries, A new default theories compilation for MSP-entailment, On propositional definability, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, First order LUB approximations: characterization and algorithms, Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach, Logical Compilation of Bayesian Networks with Discrete Variables