Proving unsatisfiability for problems with constant cubic sparsity

Artificial Intelligence 57 (1):125-137 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,682

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

On Proving Too Much.Moti Mizrahi - 2013 - Acta Analytica 28 (3):353-358.
Why constant? A critical overview of the constant revival.Helena Rosenblatt - 2004 - Modern Intellectual History 1 (3):439-453.
The cosmological constant, the fate of the universe, unimodular gravity, and all that.John Earman - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (4):559-577.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
Inference rules for unsatisfiability.David A. Plaisted - 1979 - Urbana: Dept. of Computer Science, University of Illinois at Urbana-Champaign.

Analytics

Added to PP
2020-12-22

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Philip Jackson
Tilburg University (PhD)

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references