Proving unsatisfiability of CNFs locally
type: Item
instance of: scholarly article
title: Proving unsatisfiability of CNFs locally
zbMATH Open document ID: 0995.03011
DOI: 10.1023/A:1015803927637
author: Eugene Goldberg
published in: Journal of Automated Reasoning
publication date: 2002-08-20T00:00:00Z
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 1784338
zbMATH Keywords: satisfiability
zbMATH Keywords: conjunctive normal form
MaRDI profile type: Publication
cites work: Short proofs are narrow—resolution made simple
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Q4386920
cites work: The intractability of resolution
cites work: GRASP: a search algorithm for propositional satisfiability
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Hard examples for resolution
full work available at URL: a:1015803927637
OpenAlex ID: W1540003216
description: scientific article; zbMATH DE number 1784338