The Satisfiability of Word Equations: Decidable and Undecidable Theories.
Joel D. DayVijay GaneshPaul HeFlorin ManeaDirk NowotkaPublished in: RP (2018)
Keyphrases
- datalog programs
- np complete
- guarded fragment
- query containment
- decision procedures
- satisfiability problem
- transitive closure
- first order logic
- automata theoretic
- unions of conjunctive queries
- propositional theories
- exptime complete
- data complexity
- co occurrence
- n gram
- conjunctive queries
- data exchange
- theoretical framework
- mathematical model
- query answering
- cnf formula
- propositional logic
- differential equations
- word sense disambiguation
- computational complexity
- numerical solution
- quantified boolean formulas
- word recognition
- computational properties
- computational problems
- expressive power
- description logics
- satisfiability testing
- plan existence