A TCSP-like decidable constraint language generalising existing cardinal direction relations
Amar Isli
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.
Create a lesson
Related papers
RAFT: A Stateful Retrieval-Augmented Framework for Troubleshooting Agents
Mingxuan Zhang, Xiaowen Wang, Anupma Sharan et al.
Q&A on Any Spreadsheet Requires Interpreting Its Grid Structure
Zofia Smoleń
Deep Noir: Autonomous Steering Discovery via Architectural Chronometry in Transformer Models
Frank E. Bobe, Gregory D. Vetaw, Darshan W. Bryner et al.
Ownership in AI-Assisted Everyday Tasks
Megan Wei, Melanie Subbiah, Audrey Lee et al.
PAA: The Probabilistic Allen Algebra: A Generative and Complete Probabilistic Extension of Allen's Interval Relations
Julian Eggert
Limits of Confidence in Diffusion
Russ Webb, Amitis Shidani, Alice Bizeul et al.