Hybrid EL-Unification is NP-complete.
Franz BaaderOliver Fernandez GilBarbara MorawskaPublished in: Description Logics (2013)
Keyphrases
- np complete
- randomly generated
- np hard
- pspace complete
- computational complexity
- constraint satisfaction problems
- polynomial time complexity
- satisfiability problem
- phase transition
- conjunctive queries
- higher order
- neural network
- computationally complex
- automated theorem proving
- description logics
- data sets
- knowledge representation
- optimal solution
- objective function
- theorem proving
- data complexity
- artificial intelligence
- bounded treewidth
- np complete problems
- genetic algorithm
- data mining
- knuth bendix