A TCSP-like decidable constraint language generalising existing cardinal direction relations
Amar Isli
TL;DR
This paper introduces a new decidable constraint language that generalizes existing cardinal direction relations in qualitative spatial reasoning, enabling effective solutions to related constraint satisfaction problems.
Contribution
It presents a novel, unified constraint language that encompasses well-known calculi in QSR and demonstrates how to solve CSPs within this framework.
Findings
The language subsumes Frank's cone-shaped and projection-based calculi.
It provides a method to solve CSPs expressed in the new language.
The approach ensures decidability for the generalized constraint system.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Data Management and Algorithms · Semantic Web and Ontologies