Transforming SAT into Termination of Rewriting.
Harald ZanklChristian SternagelAart MiddeldorpPublished in: Electron. Notes Theor. Comput. Sci. (2009)
Keyphrases
- termination analysis
- presburger arithmetic
- satisfiability problem
- active rules
- sat solvers
- active databases
- quantifier elimination
- sat problem
- stochastic local search
- rewriting systems
- stochastic local search algorithms
- sat solving
- rewrite rules
- max sat
- conjunctive queries
- phase transition
- rewriting rules
- search algorithm
- queries using views
- type checking
- integrity constraints
- term rewriting
- relational databases
- term rewrite systems
- boolean satisfiability
- propositional satisfiability
- orders of magnitude