The Monotone Lambek Calculus Is NP-Complete.
Mati PentusPublished in: Categories and Types in Logic, Language, and Physics (2014)
Keyphrases
- np complete
- satisfiability problem
- randomly generated
- computational complexity
- np hard
- constraint satisfaction problems
- phase transition
- polynomially solvable
- conjunctive queries
- boolean functions
- pspace complete
- upper bound
- automated deduction
- data complexity
- sat problem
- formal language
- bounded treewidth
- np complete problems
- databases
- expressive power
- data sources
- database systems