Checking the Consistency of Combined Qualitative Constraint Networks

Abstract

We study the problem of consistency checking for constraint networks over combined qualitative formalisms. We propose a framework which encompasses loose integrations and a form of spatio-temporal reasoning. In particular, we identify sufficient conditions ensuring the polynomiality of consistency checking, and we use them to find tractable subclasses.

Cite

Text

Cohen-Solal et al. "Checking the Consistency of Combined Qualitative Constraint Networks." AAAI Conference on Artificial Intelligence, 2017. doi:10.1609/AAAI.V31I1.10692

Markdown

[Cohen-Solal et al. "Checking the Consistency of Combined Qualitative Constraint Networks." AAAI Conference on Artificial Intelligence, 2017.](https://mlanthology.org/aaai/2017/cohensolal2017aaai-checking/) doi:10.1609/AAAI.V31I1.10692

BibTeX

@inproceedings{cohensolal2017aaai-checking,
  title     = {{Checking the Consistency of Combined Qualitative Constraint Networks}},
  author    = {Cohen-Solal, Quentin and Bouzid, Maroua and Niveau, Alexandre},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {1084-1090},
  doi       = {10.1609/AAAI.V31I1.10692},
  url       = {https://mlanthology.org/aaai/2017/cohensolal2017aaai-checking/}
}