SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: SAT solving for termination proofs with recursive path orders and dependency pairs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SAT solving for termination proofs with recursive path orders and dependency pairs |
scientific article |
Statements
SAT solving for termination proofs with recursive path orders and dependency pairs (English)
0 references
1 August 2013
0 references
termination
0 references
SAT solving
0 references
term rewriting
0 references
recursive path order
0 references
dependency pairs
0 references
