Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs.
Fu LiIddo TzameretZhengyu WangPublished in: CoRR (2014)
Keyphrases
- lower bound
- upper bound
- horn clauses
- propositional formulas
- cnf formula
- predicate calculus
- theorem prover
- first order logic
- objective function
- propositional logic
- branch and bound algorithm
- branch and bound
- conjunctive normal form
- max sat
- theorem proving
- upper and lower bounds
- lower and upper bounds
- optimal solution
- mathematical formulas
- propositional variables
- decision procedures
- equational theories
- satisfiability testing
- belief base
- possibilistic logic
- vc dimension
- boolean formula
- default logic
- modal logic
- worst case
- np hard
- special case
- data structure
- learning algorithm