Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus.
Robert L. ConstableWojciech MoczydlowskiPublished in: LFCS (2007)
Keyphrases
- computational complexity
- preprocessing
- np hard
- times faster
- k means
- dynamic programming
- recognition algorithm
- detection algorithm
- computationally efficient
- experimental evaluation
- expectation maximization
- linear programming
- particle swarm optimization
- clustering algorithm
- provably correct
- significant improvement
- search space
- learning algorithm
- knowledge representation
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- ant colony optimization
- optimal solution
- objective function
- selection algorithm
- improved algorithm
- propositional calculus