A TCSP-like decidable constraint language generalising existing cardinal direction relations
Artificial Intelligence
2007-05-23 v1 Logic in Computer Science
Abstract
We define a quantitative constraint language subsuming two calculi well-known in QSR (Qualitative Spatial Reasoning): Frank's cone-shaped and projection-based calculi of cardinal direction relations. We show how to solve a CSP (Constraint Satisfaction Problem) expressed in the language.
Keywords
Cite
@article{arxiv.cs/0409046,
title = {A TCSP-like decidable constraint language generalising existing cardinal direction relations},
author = {Amar Isli},
journal= {arXiv preprint arXiv:cs/0409046},
year = {2007}
}
Comments
in Proceedings of the ECAI Workshop on Spatial and Temporal Reasoning, pp. 135-139, Valencia, Spain, 2004