Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure (Q3523065): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_23 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146497100 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of point-based approaches to qualitative temporal reasoning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5693201 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for qualitative reasoning about time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity and algorithms for reasoning about time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reasoning about qualitative temporal information / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4386938 / rank | |||
Normal rank | |||
Latest revision as of 15:51, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure |
scientific article |
Statements
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure (English)
0 references
2 September 2008
0 references
