Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Deciding the Satisfiability of Combined Qualitative Constraint Networks

Quentin Cohen-Solal, Alexandre Niveau, Maroua Bouzid

TL;DR

This work presents a unified framework of multi-algebras to reason about combined qualitative constraint networks arising from loose integrations, spatio-temporal sequences, and multi-scale reasoning. It introduces symmetric qualitative formalisms and a sequential, multi-algebra semantics, together with algebraic closure as the core satisfiability mechanism and two tractability theorems that enable polynomial-time decision under suitable conditions. The authors demonstrate how to diagnose and exploit tractable fragments, including tree-structured interdependencies and projection distributivity, and introduce projection weakening as a practical tool to extend tractable coverage. As a case study, they recover and generalize the tractability of the size-topology combination (STC) and outline broader applicability to other combinations, paving the way for scalable qualitative reasoning across heterogeneous formalisms.

Abstract

Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this paper, we propose a formal framework unifying several forms of extensions and combinations of qualitative formalisms, including multi-scale reasoning, temporal sequences, and loose integrations. This framework makes it possible to reason in the context of each of these combinations and extensions, but also to study in a unified way the satisfiability decision and its complexity. In particular, we establish two complementary theorems guaranteeing that the satisfiability decision is polynomial, and we use them to recover the known results of the size-topology combination. We also generalize the main definition of qualitative formalism to include qualitative formalisms excluded from the definitions of the literature, important in the context of combinations.

Deciding the Satisfiability of Combined Qualitative Constraint Networks

TL;DR

This work presents a unified framework of multi-algebras to reason about combined qualitative constraint networks arising from loose integrations, spatio-temporal sequences, and multi-scale reasoning. It introduces symmetric qualitative formalisms and a sequential, multi-algebra semantics, together with algebraic closure as the core satisfiability mechanism and two tractability theorems that enable polynomial-time decision under suitable conditions. The authors demonstrate how to diagnose and exploit tractable fragments, including tree-structured interdependencies and projection distributivity, and introduce projection weakening as a practical tool to extend tractable coverage. As a case study, they recover and generalize the tractability of the size-topology combination (STC) and outline broader applicability to other combinations, paving the way for scalable qualitative reasoning across heterogeneous formalisms.

Abstract

Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this paper, we propose a formal framework unifying several forms of extensions and combinations of qualitative formalisms, including multi-scale reasoning, temporal sequences, and loose integrations. This framework makes it possible to reason in the context of each of these combinations and extensions, but also to study in a unified way the satisfiability decision and its complexity. In particular, we establish two complementary theorems guaranteeing that the satisfiability decision is polynomial, and we use them to recover the known results of the size-topology combination. We also generalize the main definition of qualitative formalism to include qualitative formalisms excluded from the definitions of the literature, important in the context of combinations.
Paper Structure (33 sections, 42 theorems, 35 equations, 6 figures, 6 tables)

This paper contains 33 sections, 42 theorems, 35 equations, 6 figures, 6 tables.

Table of Contents

  1. Introduction
  2. Background and Related Work
  3. Qualitative Temporal and Spatial Formalisms
  4. Combined Spatial Formalisms and Combined Temporal Formalisms
  5. Spatio-Temporal Formalisms
  6. Multi-Scale Formalisms
  7. Symmetric Qualitative Formalisms
  8. Generalized Definition
  9. Properties of Symmetric Qualitative Formalisms
  10. The Framework of Multi-algebras: Representation, Reasoning, and Satisfiability
  11. Projections and Multi-algebras
  12. Reasoning about Multi-algebra Relations
  13. Semantics of Multi-algebra Relations
  14. Satisfiability of Multi-algebra Relations
  15. Multi-Algebra Networks and Algebraic Closure
  16. ...and 18 more sections

Key Result

Proposition 9

The subclasses $\mathcal{S}_{\mathrm{PA}}$ and $\mathcal{S}_{\mathrm{\mathrm{RCA}_{8}}}$ are minimal.

Figures (6)

  • Figure 1: The $8$ relations of $\mathrm{RCC}_{8}$ in the plane.
  • Figure 2: Partial order of basic relations of $\mathrm{RCC}_{8}$ (induced by the order of Allen's relations ligozat2013qualitative)
  • Figure 3: A minimal network over $\mathrm{PA}$ to the left and its minimal network to the right ; the constraint $v_{1}\mathrel{=}v_{2}$ does not belong to any satisfiable scenario.
  • Figure 4: (a) An evolution of space points. (b) The neighborhood graph of the point algebra.
  • Figure 5: The network $N$ over $\mathrm{PA}^{3}$ (left) and its three slices (right)
  • ...and 1 more figures

Theorems & Definitions (143)

  • Example 1
  • Example 2
  • Definition 3: maddux1982somehirsch2002relation
  • Definition 4: renz1999maximal
  • Definition 5
  • Definition 6
  • Example 7
  • Definition 8
  • Proposition 9: long2015distributive
  • Example 10
  • ...and 133 more