Constraint logic programming over sets of spatial objects

Authors:
Jesús M. Almendros-Jiménez
Affiliations:
Universidad de Almeria
Venue:
Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
Year:
2005

Citing 10
Cited 2

Safe query languages for constraint databases

ACM Transactions on Database Systems (TODS)
Temporal Constraints: A Survey

Constraints
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Extended Algebra for Constraint Databases

IEEE Transactions on Knowledge and Data Engineering
Beyond Finite Domains

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Manipulating Spatial Data in Constraint Databases

SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Building a constraint-based spatial database system: model, languages, and implementation

Information Systems
Principles of Constraint Programming

Principles of Constraint Programming
Constraint Databases

Constraint Databases
Solving constraints on sets of spatial objects

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages

Applying spatial reasoning to topographical data with a grounded geographical ontology

GeoS'07 Proceedings of the 2nd international conference on GeoSpatial semantics
CLP(QS): a declarative spatial reasoning framework

COSIT'11 Proceedings of the 10th international conference on Spatial information theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint Logic Programming (CLP) is a framework integrating Constraint Programming (CP) and Logic Programming (LP). CLP is described as a general schema of combination of logic-based languages and constraint solvers. Recently, a constraint system for the handling of constraints over sets of spatial objects has been presented. In this paper we study how to consider a CLP instance for this kind of constraints. In particular, we study the fixed-point and operational semantics of such instance. With respect to the operational semantics it is described how the constraint solver interacts with the mechanism of resolution, in particular how to detect failure branches by means of a consistence constraint checker and how to achieve constraint propagation and compute solved forms.