Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions.
Willem ConradieValentin GorankoDimiter VakarelovPublished in: Fundam. Informaticae (2009)
Keyphrases
- modal logic
- computational cost
- dynamic programming
- cost function
- computational complexity
- preprocessing
- np hard
- detection algorithm
- segmentation algorithm
- image matching
- expert systems
- k means
- default logic
- worst case
- nonmonotonic logics
- temporal logic
- matching algorithm
- particle swarm optimization
- learning algorithm
- objective function