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)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(92)90107-9

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,070

External links

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

Through your library

My notes

Similar books and articles

Theorem proving with abstraction.David A. Plaisted - 1981 - Artificial Intelligence 16 (1):47-108.
Embodied artificial intelligence once again.Anna Sarosiek - 2017 - Philosophical Problems in Science 63:231-240.
Proving theorems by reuse.Christoph Walther & Thomas Kolbe - 2000 - Artificial Intelligence 116 (1-2):17-66.
On proving the termination of algorithms by machine.Christoph Walther - 1994 - Artificial Intelligence 71 (1):101-157.
Completely non-clausal theorem proving.Neil V. Murray - 1982 - Artificial Intelligence 18 (1):67-85.
Non-resolution theorem proving.W. W. Bledsoe - 1977 - Artificial Intelligence 9 (1):1-35.
Analytic resolution in theorem proving.D. Brand - 1976 - Artificial Intelligence 7 (4):285-318.
A man-machine theorem-proving system.W. W. Bledsoe & Peter Bruell - 1974 - Artificial Intelligence 5 (1):51-72.
Automatic theorem proving in set theory.D. Pastre - 1978 - Artificial Intelligence 10 (1):1-27.
Symbolic logic and mechanical theorem proving.Robert B. Anderson - 1973 - Artificial Intelligence 4 (3-4):245-246.

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