Modular Termination Proofs for Rewriting Using Dependency Pairs.
Jürgen GieslThomas ArtsEnno OhlebuschPublished in: J. Symb. Comput. (2002)
Keyphrases
- neural network
- term rewrite systems
- rewrite rules
- termination analysis
- term rewriting
- rewriting rules
- theorem prover
- dependency relations
- theorem proving
- pairwise
- formal proofs
- decision procedures
- presburger arithmetic
- database
- active rules
- conjunctive queries
- modular structure
- rewriting systems
- origin destination
- equational theories
- highly flexible
- database systems
- website
- information retrieval
- databases