Temporal Constraint Satisfaction Problems and Difference Decision Diagrams: A Compilation Map

Helene Fargier,Vincent Roger,Frederic Maris

doi:10.1109/ictai.2015.71

Temporal Constraint Satisfaction Problems and Difference Decision Diagrams: A Compilation Map

Helene Fargier, Vincent Roger + Show 1 more

Open Access

https://doi.org/10.1109/ictai.2015.71

Copy DOI

Publication Date: Nov 1, 2015

Citations: 11

Affiliation: Université Toulouse III - Paul Sabatier, Toulouse 1 Capitole University, Institut Polytechnique de Bordeaux, Université Toulouse - Jean Jaurès, Toulouse Institute of Computer Science Research

#Difference Decision Diagrams #Terms Of Algorithmic Efficiency + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

The frameworks dedicated to the representation of quantitative temporal constraint satisfaction problems, as rich as they are in terms of expressiveness, define difficult requests - typically NP-complete decision problems. It is therefore adventurous to use them for an online resolution. Hence the idea to compile the original problem into a form that could be easily solved. Difference Decision Diagrams (DDDs) have been proposed by [1] as a possible way to cope with this difficulty, following a compilation-based approach. In this article, we draw a compilation map that evaluates the relative capabilities of these languages (TCSP, STP, DTP and DDD) in terms of algorithmic efficiency, succinctness and expressiveness.

Full Text