On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
From MaRDI portal
Publication:821556
DOI10.1016/j.ic.2020.104638OpenAlexW3097371717MaRDI QIDQ821556
Michael Sioutis, Tomi Janhunen, Anastasia Paparrizou
Publication date: 21 September 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://hal-univ-artois.archives-ouvertes.fr/hal-03301105/file/main.pdf
qualitative constraintsneighbourhoodminimal labeling problemsingleton-style consistenciesspatial and temporal reasoning
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- On minimal constraint networks
- Decomposition and tractability in qualitative spatial and temporal reasoning
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- Network-based heuristics for constraint-satisfaction problems
- Temporal constraint networks
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
- On searching and indexing sequences of temporal intervals
- Discovering recurring activity in temporal networks
- Networks of constraints: Fundamental properties and applications to picture processing
- On coarser interval temporal logics
- Neighborhood singleton consistencies
- Collective singleton-based consistency for qualitative constraint networks: theory and practice
- Theoretical analysis of singleton arc consistency and its extensions
- A new modal logic for reasoning about space: spatial propositional neighborhood logic
- Emergence of Scaling in Random Networks
- Dependable reactive event-oriented planning
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Weak Composition for Qualitative Spatial and Temporal Reasoning
- Complexity and algorithms for reasoning about time
- On the minimality and global consistency of row-convex constraint networks
- SAC and neighbourhood SAC
- Neighbourhood SAC: Extensions and new algorithms
- Learning Relational Event Models from Video
This page was built for publication: On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
