Tractable approximations for temporal constraint handling
From MaRDI portal
Publication:1978249
DOI10.1016/S0004-3702(99)00089-2zbMATH Open0939.68832WikidataQ127330233 ScholiaQ127330233MaRDI QIDQ1978249FDOQ1978249
Publication date: 4 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
Cites Work
- Towards a general theory of action and time
- Temporal constraint networks
- Boolean Algebras with Operators
- On binary constraint problems
- The origin of relation algebras in the development and axiomatization of the calculus of relations
- Step by step – Building representations in algebraic logic
- A finite relation algebra with undecidable network satisfaction problem
- Expressive power and complexity in algebraic logic
- The representation of relational algebras
- The representation of relation algebras. II
- Axiomatising Various Classes of Relation and Cylindric Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Temporal constraints: A survey
- Time-bounded query generator for constraint acquisition
- Solving multi-granularity temporal constraint networks
- Relation algebras and their application in temporal and spatial reasoning
- Robust Approximation of Temporal CSP
- Title not available (Why is that?)
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
- The complexity of constraint satisfaction problems for small relation algebras
This page was built for publication: Tractable approximations for temporal constraint handling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978249)
