Non-Elementary Lower Bound for Propositional Duration Calculus.
Alexander Moshe RabinovichPublished in: Inf. Process. Lett. (1998)
Keyphrases
- lower bound
- proof procedure
- upper bound
- propositional logic
- branch and bound algorithm
- branch and bound
- theorem proving
- lower and upper bounds
- np hard
- first order logic
- objective function
- worst case
- lower bounding
- upper and lower bounds
- school children
- sufficiently accurate
- optimal solution
- linear programming relaxation
- predicate calculus
- competitive ratio
- default logic
- polynomial approximation
- knowledge compilation
- propositional satisfiability
- sample complexity
- computer algebra
- combinatorial optimization
- search algorithm
- strips planning
- satisfiability testing