Branching interval algebra: an almost complete picture
From MaRDI portal
Publication:2051838
DOI10.1016/j.ic.2021.104809OpenAlexW3209268859MaRDI QIDQ2051838
A. Bertagnon, S. Trevisani, Guido Sciavicco, A. Passantino, Marco Gavanelli
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104809
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
- Consistency in networks of relations
- A complete classification of tractability in Allen's algebra relative to subsets of basic relations
- Twenty-one large tractable subclasses of Allen's algebra
- Networks of constraints: Fundamental properties and applications to picture processing
- Decision procedures and expressiveness in the temporal logic of branching time
- Modelling and solving temporal reasoning as propositional satisfiability
- Planning temporal events using point-interval logic
- ECLiPSe – From LP to CLP
- Reasoning about temporal relations
- Weak Composition for Qualitative Spatial and Temporal Reasoning
- Unit Refutations and Horn Sets
- Complexity and algorithms for reasoning about time
- Expressive power and complexity in algebraic logic
- Reasoning about temporal relations
- Allen Linear (Interval) Temporal Logic – Translation to LTL and Monitor Synthesis
This page was built for publication: Branching interval algebra: an almost complete picture
