Efficiently Reasoning about Qualitative Constraints through Variable Elimination

@article{Sioutis2016EfficientlyRA,
  title={Efficiently Reasoning about Qualitative Constraints through Variable Elimination},
  author={Michael Sioutis and Zhiguo Long and Sanjiang Li},
  journal={Proceedings of the 9th Hellenic Conference on Artificial Intelligence},
  year={2016}
}
We introduce, study, and evaluate a novel algorithm in the context of qualitative constraint-based spatial and temporal reasoning, that is based on the idea of variable elimination, a simple and general exact inference approach in probabilistic graphical models. Given a qualitative constraint network N, our algorithm enforces a particular directional local consistency on N, which we denote by ←-consistency. Our discussion is restricted to distributive subclasses of relations, i.e., sets of… Expand
Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction
TLDR
A new algorithm, called PWC, is proposed for efficiently enforcing partial -consistency on qualitative constraint networks, that exploits the notion of abstraction for qualitative constraint Networks, utilizes certain properties of partial - Consistency, and adapts the functionalities of some state-of-theart algorithms to its design. Expand
On the utility of neighbourhood singleton-style consistencies for qualitative constraint-based spatial and temporal reasoning
A singleton-style consistency is a local consistency that verifies if each base relation (atom) of each constraint of a qualitative constraint network (QCN) can serve as a support with respect to theExpand
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning
TLDR
This paper proposesSingleton-style consistencies that are applied just on the neighbourhood of a singleton-checked constraint instead of the whole network, and makes a theoretical comparison with existing consistencies and consequently proves some properties of the new ones. Expand
On the Utility of Neighbourhood Singleton-Style Consistencies for Qualitative Constraint-Based Spatial and Temporal Reasoning
TLDR
This paper proposes singleton style consistencies that are applied just on the neighbourhood of a singleton-checked constraint instead of the whole network, and makes a theoretical comparison with existing consistencies and consequently proves some properties of the new ones. Expand
Just-In-Time Constraint-Based Inference for Qualitative Spatial and Temporal Reasoning
TLDR
A research roadmap for going beyond the state of the art in qualitative spatial and temporal reasoning (QSTR) via defining tools for tackling dynamic variants of the fundamental reasoning problems in this discipline, i.e., problems stated in terms of changing input data. Expand
Efficient Path Consistency Algorithm for Large Qualitative Constraint Networks
TLDR
For qualitative constraint networks defined over any distributive subalgebra of well-known spatio-temporal calculi, such as the Region Connection Calculus and the Interval Algebra, it is shown that DPC+ can achieve PPC very fast. Expand
Efficient Dynamic Methods for Qualitative Constraint-based Spatial and Temporal Reasoning (Position Paper)
We describe a research roadmap for going beyond the state of the art in Qualitative Spatial and Temporal Reasoning (QSTR). Our proposal involves researching novel local consistencies in theExpand
A Logical Framework for Spatial Mental Models
TLDR
It is shown that for two typical problems of spatial reasoning every aspect can be formally captured, as for example the integration of premises into one single model, or the prediction of alternative models, which represents an opportunity to completely formalize the space to reason theory. Expand
Qualitatively correct bintrees: an efficient representation of qualitative spatial information
TLDR
It is proved that such correct bintrees always exist and that they can be constructed as a sum of local representations, allowing a practically efficient construction. Expand
Spatial Cognition XII: 12th International Conference, Spatial Cognition 2020, Riga, Latvia, August 26–28, 2020, Proceedings
TLDR
A population coding approach in which place is encoded by a population of overlapping “firing fields”, each of which is activated by the recognition of an unspecific “micro-snapshot” (i.e. feature) and associated to a subsequent action. Expand
...
1
2
...

References

SHOWING 1-10 OF 46 REFERENCES
Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning
TLDR
It is shown that all the maximal tractable fragments of IA and RCC8 (containing the base relations) have patchwork and canonical solutions as long as networks are algebraically closed. Expand
Efficiently Characterizing Non-Redundant Constraints in Large Real World Qualitative Spatial Networks
TLDR
An algorithm based on ⋄G-consistency to compute the unique prime network of a RCC8 network is devised, and it significantly progresses the state-of-the-art for practical reasoning with real R CC8 networks scaling up to millions of nodes. Expand
Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints
TLDR
This paper focuses on the minimal labeling problem (MLP) and proposes an algorithm to efficiently derive all the feasible base relations of a QCN and considers chordal QCNs and a new form of partial consistency which is defined as G♦-consistency. Expand
RCC8 binary constraint network can be consistently extended
TLDR
This paper shows that any consistent RCC8 binary constraint network (RCC8 network for short) can be consistently extended and guarantees the applicability of one key technique, (Theorem 5) of [J. Renz, B. Nebel, On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus]. Expand
Weak Composition for Qualitative Spatial and Temporal Reasoning
TLDR
It turns out that the most important property of a qualitative calculus is not whether weak composition is equivalent to composition, but whether the relations are closed under constraints, and a new concept for qualitative relations, the "closure under constraints". Expand
On redundant topological constraints
TLDR
If S is a tractable subclass in which weak composition distributes over non-empty intersections, then Γ has a unique prime network, which is obtained by removing all redundant constraints from Γ, and this paper identifies a sufficient condition for a path-consistent network being minimal. Expand
On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi
TLDR
A characterisation of distributive subalgebras of qualitative calculi is given, which states that the intersection of a set of $$m\ge 3$$mi¾?3 relations in the subalgebra is nonempty if and only if the intersections of every two of these relations is non empty. Expand
A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
TLDR
This work suitably instantiate the variables of any finite, path-consistent and atomic network of RCC8 base relations by associating to them some regular closed sets of the set of real numbers. Expand
Fast algebraic methods for interval constraint problems
  • P. Ladkin, A. Reinefeld
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2004
TLDR
An effective generic method for solving constraint problems, based on Tarski’s relation algebra, using path-consistency as a pruning technique is described, and evidence is presented that the ‘phase transition’ occurs in the range 6 ≤ n. Expand
Reasoning About Qualitative Temporal Information
  • P. V. Beek
  • Computer Science, Mathematics
  • Artif. Intell.
  • 1992
TLDR
This paper defines computationally efficient procedures for solving two related reasoning tasks that arise in interval and point algebras: Given (possibly indefinite) knowledge of the relationships between some intervals or points, find one or more scenarios that are consistent with the information provided, and find all the feasible relations between every pair of interval or points. Expand
...
1
2
3
4
5
...