Login / Signup
Computational Complexity of Computing Symmetries in Finite-Domain Planning.
Alexander Shleyfman
Peter Jonsson
Published in:
J. Artif. Intell. Res. (2021)
Keyphrases
</>
finite domain
computational complexity
constraint programming
constraint satisfaction problems
constraint propagation
constraint solving
special case
np hard
np complete
global constraints
heuristic search
satisfiability problem
constraint logic programming
search strategies