The maximum length of prime implicates for instances of 3-SAT

Artificial Intelligence 92 (1-2):317-329 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,484

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.
Hard random 3-SAT problems and the Davis-Putnam procedure.Jon W. Freeman - 1996 - Artificial Intelligence 81 (1-2):183-198.
New width parameters for SAT and #SAT.Robert Ganian & Stefan Szeider - 2021 - Artificial Intelligence 295 (C):103460.
SAT Competition 2020.Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo & Martin Suda - 2021 - Artificial Intelligence 301 (C):103572.
Resolution for Max-SAT.María Luisa Bonet, Jordi Levy & Felip Manyà - 2007 - Artificial Intelligence 171 (8-9):606-618.

Analytics

Added to PP
2020-12-22

Downloads
17 (#1,045,965)

6 months
3 (#1,428,956)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.

Add more references