Tractable approximations for temporal constraint handling

DOI10.1016/S0004-3702(99)00089-2MaRDI QIDQ1978249zbMATH OpenWikidataFDO

Authors Robin Hirsch

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)

Recommendations

• Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
• Publication:5750422
• Temporal constraint networks
• Twenty-one large tractable subclasses of Allen's algebra

Cites work

• scientific article; zbMATH DE number 3857387 (Why is no real title available?)
• scientific article; zbMATH DE number 67019 (Why is no real title available?)
• scientific article; zbMATH DE number 67035 (Why is no real title available?)
• A finite relation algebra with undecidable network satisfaction problem
• Axiomatising Various Classes of Relation and Cylindric Algebras
• Boolean Algebras with Operators
• Expressive power and complexity in algebraic logic
• On binary constraint problems
• Step by step – Building representations in algebraic logic
• Temporal constraint networks
• The origin of relation algebras in the development and axiomatization of the calculus of relations
• The representation of relation algebras. II
• The representation of relational algebras
• Towards a general theory of action and time

Cited in

(12)

• scientific article; zbMATH DE number 708851 (Why is no real title available?)
• Temporal constraints: A survey
• Algebraic foundations for qualitative calculi and networks
• Time-bounded query generator for constraint acquisition
• A fast algorithm and Datalog inexpressibility for temporal reasoning
• Solving multi-granularity temporal constraint networks
• Relation algebras and their application in temporal and spatial reasoning
• Robust Approximation of Temporal CSP
• Deciding the consistency of branching time interval networks
• Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
• scientific article; zbMATH DE number 4185056 (Why is no real title available?)
• 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)