2004/09/24 by Amar Isli, Isli, Amar
Computer Science · #Artificial Intelligence (cs.AI) #Constraint Satisfaction and Optimization #Data Management and Algorithms #FOS: Computer and information sciences #I.2 (I.2.3 #I.2.4 #I.2.m) #Logic in Computer Science (cs.LO) #Semantic Web and Ontologies #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0409046
in Proceedings of the ECAI Workshop on Spatial and Temporal Reasoning, pp. 135-139, Valencia, Spain, 2004
arxiv created 2004/09/24 · openalex publication_date 2004/09/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.