A finite relation algebra with undecidable network satisfaction problem (Q4700539): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1093/jigpal/7.4.547 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043885318 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1093/JIGPAL/7.4.547 / rank | |||
Normal rank | |||
Latest revision as of 15:07, 30 December 2024
scientific article; zbMATH DE number 1356645
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite relation algebra with undecidable network satisfaction problem |
scientific article; zbMATH DE number 1356645 |
Statements
A finite relation algebra with undecidable network satisfaction problem (English)
0 references
1 November 1999
0 references
undecidability
0 references
tiling
0 references
relation algebra
0 references
network satisfaction problem
0 references
