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

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.
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01303829
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, April 18, 2016 - 4:38:13 PM
Last modification on : Friday, April 12, 2019 - 4:23:05 PM
Document(s) archivé(s) le : Tuesday, July 19, 2016 - 2:56:13 PM

File

fargier_15483.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hélène Fargier, Frédéric Maris, Vincent Roger. Temporal Constraint Satisfaction Problems and Difference Decision Diagrams: A Compilation Map. 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2015), Nov 2015, Vietri sul Mare, Italy. pp.429-436, ⟨10.1109/ICTAI.2015.71⟩. ⟨hal-01303829⟩

Share

Metrics

Record views

155

Files downloads

69