A new tractable subclass of the rectangle algebra

Philippe Balbiani (1) , Jean-François Condotta (2) , Luis Fariñas del Cerro (2, 3)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 IRIT-LILaC - Logique, Interaction, Langue et Calcul
3 CNRS - Centre National de la Recherche Scientifique

This paper presents the 169 permitted relations between two rectangles whose sides are parallel to the axes of some orthogonal basis in a 2-dimensional Euclidean space. Elaborating rectangle algebra just like interval algebra, it defines the concept of convexity as well as the ones of weak preconvexity and strong preconvexity. It introduces afterwards the fundamental operations of intersection, composition and inversion and demonstrates that the concept of weak preconvexity is preserved by the operation of composition whereas the concept of strong preconvexity is preserved by the operation of intersection. Finally, fitting the propagation techniques conceived to solve interval networks, it shows that the polynomial path-consistency algorithm is a decision method for the problem of proving the consistency of strongly preconvex rectangle networks.

Domaines: Intelligence artificielle [cs.AI]

Philippe Balbiani, Jean-François Condotta, Luis Fariñas del Cerro. A new tractable subclass of the rectangle algebra. Sixteenth International Joint Conference on Artificial Intelligence (IJCAI 1999), The International Joint Conferences on Artificial Intelligence, Inc., 1999, Stockholm, Sweden. pp.442-447. ⟨hal-03300314⟩