An abstract decision procedure for satisfiability in the theory of recursive data types (Q2864522)
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: An abstract decision procedure for satisfiability in the theory of recursive data types |
scientific article; zbMATH DE number 6236519
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An abstract decision procedure for satisfiability in the theory of recursive data types |
scientific article; zbMATH DE number 6236519 |
Statements
6 December 2013
0 references
recursive data types
0 references
decision procedures
0 references
term algebras
0 references
satisfiability modulo theories
0 references
0 references
0.9116274
0 references
0.9064273
0 references
0.9012357
0 references
0.9012357
0 references
0.8947776
0 references
0.8762183
0 references
0.87540555
0 references
0.8750243
0 references
An abstract decision procedure for satisfiability in the theory of recursive data types (English)
0 references
