A Lazy Algorithm to Efficiently Approximate Singleton Path Consistency for Qualitative Constraint Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A Lazy Algorithm to Efficiently Approximate Singleton Path Consistency for Qualitative Constraint Networks

Fichier non déposé

Dates et versions

hal-02067927 , version 1 (14-03-2019)

Identifiants

Citer

Michael Sioutis, Anastasia Paparrizou, Jean-François Condotta. A Lazy Algorithm to Efficiently Approximate Singleton Path Consistency for Qualitative Constraint Networks. 29th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2017), Nov 2017, Boston, United States. pp.110-117, ⟨10.1109/ICTAI.2017.00028⟩. ⟨hal-02067927⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More