We present a formalism, Disjunctive Linear Relations (DLRs), for reasoning about temporal constraints. DLRs subsume most of the formalisms for temporal constraint reasoning proposed in the literature and is therefore computationally expensive. We also present a restricted type of DLRs, Horn DLRs, wh
Querying Temporal Constraint Networks: A Unifying Approach
β Scribed by Manolis Koubarakis
- Book ID
- 110392479
- Publisher
- Springer US
- Year
- 2002
- Tongue
- English
- Weight
- 138 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0924-669X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We start with the assumption that temporal and spatial knowledge usually captured by constraint networks can be represented and queried more effectively by using the scheme of indefinite constraint databases. Because query evaluation in this scheme is in general a hard computational problem, we seek
In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifaci