On the descriptive complexity of temporal constraint satisfaction problems (Q6567262)
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: On the descriptive complexity of temporal constraint satisfaction problems |
scientific article; zbMATH DE number 7876155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the descriptive complexity of temporal constraint satisfaction problems |
scientific article; zbMATH DE number 7876155 |
Statements
On the descriptive complexity of temporal constraint satisfaction problems (English)
0 references
4 July 2024
0 references
temporal constraint satisfaction problems
0 references
fixed-point logic
0 references
Maltsev conditions
0 references
0 references
0.9726566076278688
0 references
0.8415261507034302
0 references
0.8400113582611084
0 references
0.8284236192703247
0 references
0.8274177312850952
0 references
