# Consistency of Chordal RCC-8 Networks

@article{Sioutis2012ConsistencyOC,
title={Consistency of Chordal RCC-8 Networks},
author={Michael Sioutis and Manolis Koubarakis},
journal={2012 IEEE 24th International Conference on Tools with Artificial Intelligence},
year={2012},
volume={1},
pages={436-443}
}
• Published 2012
• Mathematics, Computer Science
• 2012 IEEE 24th International Conference on Tools with Artificial Intelligence
We consider chordal RCC-8 networks and show that we can check their consistency by enforcing partial path consistency with weak composition. We prove this by using the fact that RCC-8 networks with relations from the maximal tractable subsets H8, C8, and Q8 of RCC-8 have the patchwork property. The use of partial path consistency has important practical consequences that we demonstrate with the implementation of the new reasoner PyRCC∇, which is developed by extending the state of the art… Expand
Fast Consistency Checking of Very Large Real-World RCC-8 Constraint Networks Using Graph Partitioning
• Computer Science
• AAAI
• 2014
We present a new reasoner for RCC-8 constraint networks, called gp-rcc8, that is based on the patchwork property of path-consistent tractable RCC-8 networks and graph partitioning. We compare gp-rcc8Expand
Incrementally Building Partially Path Consistent Qualitative Constraint Networks
• Computer Science
• AIMSA
• 2014
A framework to compute the path consistency of a given Qualitative Constraint Network (QCN) and propose an algorithm for maintaining or enforcing partial path consistency for growing constraint networks, i.e., networks that grow with new temporal or spatial entities over time. Expand
Efficiently Characterizing Non-Redundant Constraints in Large Real World Qualitative Spatial Networks
• Computer Science
• IJCAI
• 2015
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 Path Consistency Algorithm for Large Qualitative Constraint Networks
• Mathematics, Computer Science
• IJCAI
• 2016
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
On redundant topological constraints
• Mathematics, Computer Science
• Artif. Intell.
• 2015
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
A Practical Approach for Maximizing Satisfiability in Qualitative Spatial and Temporal Constraint Networks
• Computer Science
• 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)
• 2015
This work introduces and studies the problem of obtaining a spatial or temporal configuration that maximizes the number of constraints satisfied in a qualitative constraint network (QCN), and proposes a complete generic branch and bound algorithm for solving the MAX-QCN problem. Expand
Efficiently Reasoning about Qualitative Constraints through Variable Elimination
• Computer Science
• SETN
• 2016
A novel algorithm is introduced, study, and evaluate, that is based on the idea of variable elimination, a simple and general exact inference approach in probabilistic graphical models, that enforces a particular directional local consistency on N, which is denote by ←-consistency. Expand
Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints
• Mathematics, Computer Science
• IJCAI
• 2013
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
Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning
• Computer Science
• The Knowledge Engineering Review
• 2017
It is proved that a recently proposed decomposition-based approach for checking the satisfiability of qualitative spatial constraint networks lacks soundness, and a particular tree decomposition is presented that allows for cost-free utilization of parallelism for a qualitative constraint language that has patchwork for satisfiable atomic networks. Expand
An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks
• Mathematics, Computer Science
• CP
• 2018
This article proposes an incremental $$\mathrm {SAT}$$-based approach for providing a framework that reasons about the RCC language in a counterexample-guided manner and restricts ourselves to QCNs that, when satisfiable, are realizable with rectangles. Expand

#### References

SHOWING 1-10 OF 26 REFERENCES
Path Consistency on Triangulated Constraint Graphs
• Mathematics, Computer Science
• IJCAI
• 1999
This paper shows that Montanari's theorem extends to triangulated graphs, and one can therefore enforce PC on sparse graphs by triangulating instead of completing them, and compares the pruning capacity of the two approaches. Expand
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
A general method for proving tractability of reasoning over disjunctions of jointly exhaustive and pairwise disjoint relations of Allen's temporal interval relations and their spatial counterpart, the R.CC8 relations by Randell, Cui, and Colin is presented. Expand
A Divide-and-Conquer Approach for Solving Interval Algebra Networks
• Mathematics, Computer Science
• IJCAI
• 2009
A divide-and-conquer method that recursively partitions a given problem into smaller sub-problems in deciding consistency is introduced and a key theoretical property of a qualitative calculus is identified that ensures the soundness and completeness of this method. Expand
Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning
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
Consistency of Triangulated Temporal Qualitative Constraint Networks
• Mathematics, Computer Science
• 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
• 2011
It is shown that for the pre-convex QCNs of the Interval Algebra (IA), the partial weak composition consistency with respect to a triangulation of the graph of constraints is sufficient to decide the consistency problem. Expand
Weak Composition for Qualitative Spatial and Temporal Reasoning
• Mathematics, Computer Science
• CP
• 2005
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 the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus
• Mathematics, Computer Science
• Artif. Intell.
• 1999
It is proved that reasoning is NP-complete in general and identified a maximal tractable subset of the relations in RCC-8 that contains all base relations and shows that for this subset path-consistency is sufficient for deciding consistency. Expand
The Design and Experimental Analysis of Algorithms for Temporal Reasoning
• Computer Science
• J. Artif. Intell. Res.
• 1996
This paper discusses the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information, and develops variable and value ordering heuristics that are shown empirically to dramatically improve the performance of the algorithm. Expand
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
• Mathematics, Computer Science
• Journal of Automated Reasoning
• 2006
This paper identifies a general property of concrete domains that is sufficient for proving decidability of DLs with both concrete domains and general TBoxes, and presents a tableau algorithm for reasoning in DLs equipped with concrete domainsand general T boxes. Expand
RCC8 Is Polynomial on Networks of Bounded Treewidth
• Mathematics, Computer Science
• IJCAI
• 2011
It is obtained that the network consistency problem for RCC8 can be solved in polynomial time for networks of bounded treewidth. Expand