Resolution graphs

, &
Artificial Intelligence 1 (3-4):257-289 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(70)90011-1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,440

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

Relative efficiency of propositional proof systems: resolution vs. cut-free LK.Noriko H. Arai - 2000 - Annals of Pure and Applied Logic 104 (1-3):3-16.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Peirce's Logical Graphs for Boolean Algebras and Distributive Lattices.Minghui Ma - 2018 - Transactions of the Charles S. Peirce Society 54 (3):320.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Remarks on the iconicity and interpretation of existential graphs.Risto Hilpinen - 2011 - Semiotica 2011 (186):169-187.
Game-theoretical semantics for Peirce's existential graphs.Robert W. Burch - 1994 - Synthese 99 (3):361 - 375.
Relational treatment of term graphs with bound variables.W. Kahl - 1998 - Logic Journal of the IGPL 6 (2):259-303.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Duplication of directed graphs and exponential blow up of proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part A†.Hannes Leitgeb - 2020 - Philosophia Mathematica 28 (3):317-346.
.Jay Zeman - unknown
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,439,475)

6 months
5 (#633,186)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Linear resolution with selection function.Robert Kowalski & Donald Kuehner - 1971 - Artificial Intelligence 2 (3-4):227-260.
Refutation graphs.Robert E. Shostak - 1976 - Artificial Intelligence 7 (1):51-64.

Add more citations

References found in this work

A Review of Automatic Theorem-Proving. [REVIEW]J. A. Robinson - 1974 - Journal of Symbolic Logic 39 (1):190-190.

Add more references