Satisfiability of Word Equations with Constants is in NEXPTIME.
Wojciech PlandowskiPublished in: STOC (1999)
Keyphrases
- satisfiability problem
- np complete
- search algorithm
- phase transition
- n gram
- temporal logic
- sat problem
- co occurrence
- upper bound
- numerical solution
- pspace complete
- mathematical model
- datalog programs
- linguistic information
- propositional logic
- hidden markov models
- computational complexity
- differential equations
- multiword
- natural language text
- keywords
- information extraction