Login / Signup
A Lazy Algorithm to Efficiently Approximate Singleton Path Consistency for Qualitative Constraint Networks.
Michael Sioutis
Anastasia Paparrizou
Jean-François Condotta
Published in:
ICTAI (2017)
Keyphrases
</>
path consistency
learning algorithm
dynamic programming
search space
k means
np hard
global consistency
optimal solution
objective function
data structure
computational complexity
arc consistency
singleton arc consistency