Assignment precipitation in fail first search

Author(s)
Namazi, M
Ghooshchi, NG
Hakim Newton, MA
Sattar, A
Griffith University Author(s)
Year published
2016
Metadata
Show full item record
Abstract
Within a fail first search, we relocate assignments towards the bottom of the upward-growing assignment stack. We do that when the related variables, due to search dynamics, become more constrained than were anticipated before. This fixes early variable selection mistakes.
Journal Title
Lecture Notes in Computer Science
Volume
9992
DOI
Subject
Other information and computing sciences not elsewhere classified
Publication URI
Collection