The following pages link to Decomposable negation normal form (Q5441353):
Displayed 10 items.
- Compiling propositional weighted bases (Q814606) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- A new default theories compilation for MSP-entailment (Q989883) (← links)
- On propositional definability (Q2389643) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach (Q3011984) (← links)
- Logical Compilation of Bayesian Networks with Discrete Variables (Q3524963) (← links)
- Recursive conditioning (Q5940818) (← links)