Branching interval algebra: an almost complete picture
From MaRDI portal
Publication:2051838
Recommendations
- Deciding the consistency of branching time interval networks
- Twenty-one large tractable subclasses of Allen's algebra
- Computational complexity of relating time points with intervals
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- scientific article; zbMATH DE number 1882046
Cites work
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
- A complete classification of tractability in Allen's algebra relative to subsets of basic relations
- Allen Linear (Interval) Temporal Logic – Translation to LTL and Monitor Synthesis
- Complexity and algorithms for reasoning about time
- Consistency in networks of relations
- Deciding the consistency of branching time interval networks
- Decision procedures and expressiveness in the temporal logic of branching time
- Expressive power and complexity in algebraic logic
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1882046 (Why is no real title available?)
- Maintaining knowledge about temporal intervals
- Modelling and solving temporal reasoning as propositional satisfiability
- Networks of constraints: Fundamental properties and applications to picture processing
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
- Planning temporal events using point-interval logic
- Reasoning about temporal relations
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- Twenty-one large tractable subclasses of Allen's algebra
- Unit Refutations and Horn Sets
- Weak Composition for Qualitative Spatial and Temporal Reasoning
Cited in
(7)- Twenty-one large tractable subclasses of Allen's algebra
- Allen-like theory of time for tree-like structures
- scientific article; zbMATH DE number 1882046 (Why is no real title available?)
- Deciding the consistency of branching time interval networks
- Solving infinite-domain CSPs using the patchwork property
- On prime scenarios in qualitative spatial and temporal reasoning
- Complexity classification transfer for CSPs via algebraic products
This page was built for publication: Branching interval algebra: an almost complete picture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051838)
