Article Dans Une Revue International Journal of Approximate Reasoning Année : 2026

Optimal contractor for n-gons constraint

Résumé

This paper presents an optimal method for contracting a n-gons Constraints Satisfaction Problem (CSP), composed of n > 2 domains and distance constraints. This contribution takes into account all constraints globally, unlike existing interval analysis approaches, and focuses on the edges of the CSP boxes, rather than on their entirety, to compute the smallest boxes enclosing the CSP solution. It is based on constraint propagation, interval analysis tools and some properties of the boundary solution of the n-gons CSP.

Fichier non déposé

Dates et versions

hal-05560336 , version 1 (20-03-2026)

Identifiants

Citer

Algassimou Diallo, Sebastien Lagrange, Rémy Guyonneau, Daouda Niang Diatta, Sébastien Lahaye. Optimal contractor for n-gons constraint. International Journal of Approximate Reasoning, 2026, 193, pp.109667. ⟨10.1016/j.ijar.2026.109667⟩. ⟨hal-05560336⟩
19 Consultations
0 Téléchargements

Altmetric

Partager

  • More