Solving partial order constraints for LPO termination (Q3620437)
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: Solving partial order constraints for LPO termination |
scientific article; zbMATH DE number 5542983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving partial order constraints for LPO termination |
scientific article; zbMATH DE number 5542983 |
Statements
14 April 2009
0 references
lexicographic path orders
0 references
term rewrite systems
0 references
Boolean satisfiability
0 references
0.9389916658401488
0 references
0.8112026453018188
0 references
0.7789883017539978
0 references
0.7759385704994202
0 references
0.745461642742157
0 references
