Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.44, Iss.1-2, 2005-05, pp. : 157-177

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

Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver

By Van Gelder Allen

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

Springer Publishing Company

Access to resources Recommend Favorite

Toward leaner binary-clause reasoning in a satisfiability solver

By Gelder Allen

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

Springer Publishing Company

Access to resources Recommend Favorite

Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points

By Goldberg Eugene

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

Springer Publishing Company

Access to resources Recommend Favorite

Testing satisfiability of CNF formulas by computing a stable set of points

By Goldberg Eugene

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

Springer Publishing Company

Access to resources Recommend Favorite

An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs

By Anjos Miguel

Annals of Mathematics and Artificial Intelligence, Vol. 48, Iss. 1-2, 2006-09 ,pp. : 1-14

Springer Publishing Company

Access to resources Recommend Favorite