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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,063

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.
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.
Completely non-clausal theorem proving.Neil V. Murray - 1982 - Artificial Intelligence 18 (1):67-85.
Automatic theorem proving in set theory.D. Pastre - 1978 - Artificial Intelligence 10 (1):1-27.
A man-machine theorem-proving system.W. W. Bledsoe & Peter Bruell - 1974 - Artificial Intelligence 5 (1):51-72.
Proving properties of states in the situation calculus.Raymond Reiter - 1993 - Artificial Intelligence 64 (2):337-351.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,799,137)

6 months
4 (#1,232,162)

Historical graph of downloads
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