Deciding the consistency of branching time interval networks
From MaRDI portal
Publication:5079779
Recommendations
Cites work
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1753151 (Why is no real title available?)
- Allen-like theory of time for tree-like structures
- An initial study of time complexity in infinite-domain constraint satisfaction
- Consistency in networks of relations
- Expressive power and complexity in algebraic logic
- Fast algebraic methods for interval constraint problems
- Generalized constraint propagation over the CLP scheme
- Maintaining knowledge about temporal intervals
- 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
- Topology
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
Cited in
(7)- Complexity classification transfer for CSPs via algebraic products
- Finding a consistent scenario to an interval algebra network containing possibly infinite intervals
- Branching interval algebra: an almost complete picture
- Consistency of a time-stepping method for a class of piecewise-linear networks
- scientific article; zbMATH DE number 7760475 (Why is no real title available?)
- Allen-like theory of time for tree-like structures
- Tractability Results in the Block Algebra
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)
