A Tableau Algorithm for DLs with Concrete Domains and GCIs.
Carsten LutzMaja MilicicPublished in: Description Logics (2005)
Keyphrases
- constraint satisfaction problems
- search space
- np hard
- np complete
- learning algorithm
- description logics
- worst case
- times faster
- significant improvement
- cost function
- dynamic programming
- improved algorithm
- matching algorithm
- high accuracy
- computational cost
- experimental evaluation
- evolutionary algorithm
- computationally efficient
- theoretical analysis
- preprocessing
- classification algorithm
- computational complexity
- objective function
- real world
- simulated annealing
- expectation maximization
- convergence rate
- recognition algorithm