On the utility of neighbourhood singleton-style consistencies for qualitative constraint-based spatial and temporal reasoning

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Researchers

Research units

  • Universite d'Artois
  • Tampere University

Abstract

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 the closure of that network under a (naturally) weaker local consistency. This local consistency is essential for tackling fundamental reasoning problems associated with QCNs, such as the satisfiability checking or the minimal labeling problem, but can suffer from redundant constraint checks, especially when those checks occur far from where the pruning usually takes place. In this paper, we propose singleton-style consistencies that are applied just on the neighbourhood of a singleton-checked constraint instead of the whole network. We make a theoretical comparison with existing consistencies and consequently prove some properties of the new ones. In addition, we propose algorithms to enforce our consistencies, as well as parsimonious variants thereof, that are more efficient in practice than the state of the art. We make an experimental evaluation with random and structured QCNs of Interval Algebra in the phase transition region to demonstrate the potential of our approach.

Details

Original languageEnglish
Title of host publication26th International Symposium on Temporal Representation and Reasoning, TIME 2019
EditorsJohann Gamper, Sophie Pinchinat, Guido Sciavicco
Publication statusPublished - 1 Oct 2019
MoE publication typeA4 Article in a conference publication
EventInternational Symposium on Temporal Representation and Reasoning - Malaga, Spain
Duration: 16 Oct 201919 Oct 2019
Conference number: 26
https://sites.google.com/unife.it/time-2019/

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume147
ISSN (Print)1868-8969

Conference

ConferenceInternational Symposium on Temporal Representation and Reasoning
Abbreviated titleTIME
CountrySpain
CityMalaga
Period16/10/201919/10/2019
Internet address

    Research areas

  • Minimal labeling problem, Neighbourhood, Qualitative constraints, Singleton-style consistencies, Spatial and temporal reasoning

ID: 38171105