Deciding the consistency of branching time interval networks
From MaRDI portal
Publication:5079779
DOI10.4230/LIPICS.TIME.2018.12zbMATH Open1487.68212MaRDI QIDQ5079779FDOQ5079779
Authors: Marco Gavanelli, A. Passantino, Guido Sciavicco 
Publication date: 28 May 2022
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
- Maintaining knowledge about temporal intervals
- Consistency in networks of relations
- Title not available (Why is that?)
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- Fast algebraic methods for interval constraint problems
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
- Expressive power and complexity in algebraic logic
- Title not available (Why is that?)
- An initial study of time complexity in infinite-domain constraint satisfaction
- Generalized constraint propagation over the CLP scheme
- Topology
- Allen-like theory of time for tree-like structures
Cited In (7)
- Title not available (Why is that?)
- Finding a consistent scenario to an interval algebra network containing possibly infinite intervals
- Complexity classification transfer for CSPs via algebraic products
- Tractability Results in the Block Algebra
- Branching interval algebra: an almost complete picture
- Consistency of a time-stepping method for a class of piecewise-linear networks
- Allen-like theory of time for tree-like structures
This page was built for publication: Deciding the consistency of branching time interval networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079779)
