Qualitative Constraints Representation for the Time and Space in SAT
Jean-François Condotta, Dominique d'Almeida · 2007
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in the framework of the prepositional logic is proposed. The definition of this encoding presupposes the existence of a particular order on the basic relations of the qualitative calculus such as that of the conceptual lattice of the interval algebra of Allen.