A coinductive approach to proving reachability properties in logically constrained term rewriting systems (Q1799091)
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: A coinductive approach to proving reachability properties in logically constrained term rewriting systems |
scientific article; zbMATH DE number 6958106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A coinductive approach to proving reachability properties in logically constrained term rewriting systems |
scientific article; zbMATH DE number 6958106 |
Statements
A coinductive approach to proving reachability properties in logically constrained term rewriting systems (English)
0 references
18 October 2018
0 references
0.789996862411499
0 references
0.7643985748291016
0 references
0.7567360401153564
0 references
0.7541777491569519
0 references
0.7414627075195312
0 references
