An Overview of Backtrack Search Satisfiability Algorithms

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.37, Iss.3, 2003-03, pp. : 307-326

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient data structures for backtrack search SAT solvers

By Lynce Inês

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 137-152

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Data Structures for Backtrack Search SAT Solvers

By Lynce Inês

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 137-152

Springer Publishing Company

Access to resources Recommend Favorite

Satisfiability-Based Algorithms for Boolean Optimization

By Manquinho Vasco M.

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 353-372

Springer Publishing Company

Access to resources Recommend Favorite

Average case results for satisfiability algorithms under the random-clause-width model

By Franco J. Swaminathan R.P.

Annals of Mathematics and Artificial Intelligence, Vol. 20, Iss. 1-4, 1997-01 ,pp. : 357-391

Springer Publishing Company

Access to resources Recommend Favorite

Coordinate search algorithms in multilevel optimization

By Frandi Emanuele Papini Alessandra

Optimization Methods and Software, Vol. 29, Iss. 5, 2014-09 ,pp. : 1020-1041

Taylor & Francis Ltd

Access to resources Recommend Favorite