Monadic Second-Order Unification Is NP-Complete.
Jordi LevyManfred Schmidt-SchaußMateu VillaretPublished in: RTA (2004)
Keyphrases
- np complete
- higher order
- conjunctive queries
- np hard
- randomly generated
- datalog programs
- deductive databases
- computational complexity
- function symbols
- constraint satisfaction problems
- satisfiability problem
- datalog queries
- query containment
- polynomially solvable
- high order
- polynomial time complexity
- equational theories
- theorem proving
- np complete problems
- theorem prover
- cnf formula
- data complexity
- pspace complete
- bounded treewidth
- neural network
- conp complete
- knuth bendix
- hessian matrix
- decision problems
- integrity constraints
- optimal solution
- database systems