Unification Modulo Associativity and Idempotency Is NP-complete.
Ondrej KlímaPublished in: MFCS (2002)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- pspace complete
- theorem proving
- higher order
- conjunctive queries
- equational theories
- sat problem
- artificial intelligence
- phase transition
- theorem prover
- relational databases
- lower bound
- similarity measure
- bounded treewidth
- np complete problems
- automated theorem proving
- knuth bendix