Approximate Quantifier Elimination for Propositional Boolean Formulae.
Jörg BrauerAndy KingPublished in: NASA Formal Methods (2011)
Keyphrases
- quantifier elimination
- boolean formulae
- first order logic
- expressive power
- conjunctive normal form
- constraint propagation
- propositional logic
- functional programming
- cardinality constraints
- constraint databases
- theorem proving
- inference rules
- theorem prover
- boolean variables
- horn clauses
- knowledge representation
- expert systems
- phase transition
- databases
- inductive logic programming
- logic programming
- disjunctive normal form
- special case