Using Restarts in Constraint Programming over Finite Domains - An Experimental Evaluation

The use of restart techniques in complete Satisfiability (SAT) algorithms has made solving hard real world instances possible. Without restarts such algorithms could not solve those instances, in practice. State of the art algorithms for SAT use restart techniques, conflict clause recording (nogoods...

Full description

Bibliographic Details
Main Author: Baptista, Luís Manuel Tremoceiro (author)
Format: doctoralThesis
Language:eng
Published: 2018
Subjects:
restarts
nogoods
heuristics
constraint programming
backtrack search
Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
Online Access:http://hdl.handle.net/10362/29110
Country:Portugal
Oai:oai:run.unl.pt:10362/29110

Internet

http://hdl.handle.net/10362/29110

Similar Items