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...

ver descrição completa

Detalhes bibliográficos
Autor principal: Baptista, Luís Manuel Tremoceiro (author)
Formato: doctoralThesis
Idioma:eng
Publicado em: 2018
Assuntos:
restarts
nogoods
heuristics
constraint programming
backtrack search
Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
Texto completo:http://hdl.handle.net/10362/29110
País:Portugal
Oai:oai:run.unl.pt:10362/29110

Texto Completo

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

Registros relacionados