A TCSP-like decidable constraint language generalising existing cardinal direction relations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
in Proceedings of the ECAI Workshop on Spatial and Temporal Reasoning, pp. 135-139, Valencia, Spain, 2004

Keywords

Artificial Intelligence, Logic in Computer Science, I.2 (I.2.3; I.2.4; I.2.m)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32345

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0409046
 http://arxiv.org/abs/cs/0409046

Collections

arXiv