Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA.
Willem ConradieValentin GorankoDimiter VakarelovPublished in: J. Log. Comput. (2006)
Keyphrases
- modal logic
- k means
- detection algorithm
- preprocessing
- optimization algorithm
- cost function
- dynamic programming
- inference rules
- segmentation algorithm
- objective function
- np hard
- learning algorithm
- worst case
- expectation maximization
- search space
- computational complexity
- optimal solution
- simulated annealing
- particle swarm optimization
- evolutionary algorithm
- matching algorithm