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

ISSN： 1012-2443

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

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

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

Generalizations of matched CNF formulas

By Szeider Stefan

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

Springer Publishing Company

Access to resources Recommend Favorite

Generalizations of Matched CNF Formulas

By Szeider Stefan

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

Springer Publishing Company

Access to resources Recommend Favorite

Testing satisfiability

By Alon N. Shapira A.

Journal of Algorithms, Vol. 47, Iss. 2, 2003-07 ,pp. : 87-103

Elsevier

Access to resources Recommend Favorite

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

By Maaren Hans

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

Springer Publishing Company

Access to resources Recommend Favorite