Resolution and the integrality of satisfiability problems
type: Item
instance of: scholarly article
title: Resolution and the integrality of satisfiability problems
zbMATH Open document ID: 0868.90082
DOI: 10.1007/BF02592142
published in: Mathematical Programming. Series A. Series B
publication date: 1997-08-18T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 977964
zbMATH Keywords: satisfiability problem
zbMATH Keywords: nondisjoint of set covering problems
zbMATH Keywords: theorem proving
zbMATH Keywords: resolution
author: John N. Hooker
MaRDI profile type: Publication
cites work: Balanced matrices
cites work: Q4255462
cites work: Q4228441
cites work: Q4133404
cites work: Q3789107
cites work: Probabilistic satisfiability
cites work: Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
cites work: The intractability of resolution
cites work: Algorithms for the maximum satisfiability problem
cites work: Column Generation Methods for Probabilistic Logic
cites work: On the complexity of the maximum satisfiability problem for Horn formulas
cites work: Probabilistic logic
cites work: The Problem of Simplifying Truth Functions
cites work: A Way to Simplify Truth Functions
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Q3818127
cites work: Algebraic Characterizations of Unimodular Matrices
full work available at URL: https://doi.org/10.1007/bf02592142
OpenAlex ID: W2048762035
description: scientific article; zbMATH DE number 977964