Recurrence with affine level mappings is P-time decidable for CLP (Q5437651)
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: Recurrence with affine level mappings is P-time decidable for CLP |
scientific article; zbMATH DE number 5229054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recurrence with affine level mappings is P-time decidable for CLP |
scientific article; zbMATH DE number 5229054 |
Statements
Recurrence with affine level mappings is P-time decidable for CLP (English)
0 references
21 January 2008
0 references
constraint logic programming
0 references
termination
0 references
decidability
0 references
0.7628196477890015
0 references
0.7601487636566162
0 references
0.7218675017356873
0 references
0.7118858695030212
0 references
0.7101663947105408
0 references
