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

Simple item page
dc.creatorIsli, Amar
dc.date2004-09-24
dc.date.accessioned2026-07-07T03:21:48Z
dc.date.available2026-07-07T03:21:48Z
dc.descriptionWe 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.
dc.descriptionin Proceedings of the ECAI Workshop on Spatial and Temporal Reasoning, pp. 135-139, Valencia, Spain, 2004
dc.identifierhttps://arxiv.org/abs/cs/0409046
dc.identifierhttp://arxiv.org/abs/cs/0409046
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32345
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectI.2 (I.2.3; I.2.4; I.2.m)
dc.titleA TCSP-like decidable constraint language generalising existing cardinal direction relations
dc.typetext

Files

Collections

arXiv