Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution

Authors:
Jörg H. Siekmann;Graham Wrightson
Affiliations:
Univ. des Saarlandes/DFKI, Saarbrücken, Germany;Univ. of Newcastle, New South Wales, Germany
Venue:
Journal of the ACM (JACM)
Year:
2001

Citing 3
Cited 2

Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution

Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
Completeness, Confluence, and Related Properties of Clause Graph Resolution

Completeness, Confluence, and Related Properties of Clause Graph Resolution

An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Ordered Resolution vs. Connection Graph Resolution

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Quantified Score

Hi-index	0.01

Visualization

Abstract