Resolution and the integrality of satisfiability problems

DOI10.1007/BF02592142zbMath0868.90082OpenAlexW2048762035MaRDI QIDQ1352293

John N. Hooker

Publication date: 18 August 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592142

zbMATH Keywords

theorem provingsatisfiability problemresolutionnondisjoint of set covering problems

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Clean Clutters and Dyadic Fractional Packings, \((0,\pm 1)\) ideal matrices, (0, ±1) ideal matrices, Balanced matrices, Perfect \(0,\pm 1\) matrices, Ideal clutters, Perfect, ideal and balanced matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the maximum satisfiability problem
• The intractability of resolution
• Probabilistic logic
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• On the complexity of the maximum satisfiability problem for Horn formulas
• Probabilistic satisfiability
• A Way to Simplify Truth Functions
• Column Generation Methods for Probabilistic Logic
• Algebraic Characterizations of Unimodular Matrices
• A Machine-Oriented Logic Based on the Resolution Principle
• Balanced matrices
• The Problem of Simplifying Truth Functions