Tractable approximations for temporal constraint handling

DOI10.1016/S0004-3702(99)00089-2zbMath0939.68832WikidataQ127330233 ScholiaQ127330233MaRDI QIDQ1978249

Robin Hirschl

Publication date: 4 June 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

approximationrelation algebratemporal constraintsnetwork satisfaction problemtractable

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Logic in artificial intelligence (68T27)

Related Items (2)

Relation algebras and their application in temporal and spatial reasoning ⋮ The complexity of constraint satisfaction problems for small relation algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The representation of relation algebras. II
• Towards a general theory of action and time
• Temporal constraint networks
• The origin of relation algebras in the development and axiomatization of the calculus of relations
• The representation of relational algebras
• Axiomatising Various Classes of Relation and Cylindric Algebras
• On binary constraint problems
• Step by step – Building representations in algebraic logic
• Expressive power and complexity in algebraic logic
• A finite relation algebra with undecidable network satisfaction problem
• Boolean Algebras with Operators

This page was built for publication: Tractable approximations for temporal constraint handling