Resolution and the integrality of satisfiability problems

DOI10.1007/BF02592142MaRDI QIDQ1352293zbMATH OpenOpenAlexFDO

Authors 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

resolutiontheorem provingsatisfiability problemnondisjoint of set covering problems

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 120352
• Generalized resolution for 0--1 linear inequalities
• Linear programs for constraint satisfaction problems
• Computational experience with an interior point algorithm on the satisfiability problem
• scientific article; zbMATH DE number 496040

Cites work

• scientific article; zbMATH DE number 4053069 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3557519 (Why is no real title available?)
• scientific article; zbMATH DE number 1256705 (Why is no real title available?)
• scientific article; zbMATH DE number 1324220 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A Way to Simplify Truth Functions
• Algebraic Characterizations of Unimodular Matrices
• Algorithms for the maximum satisfiability problem
• Balanced matrices
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Column Generation Methods for Probabilistic Logic
• On the complexity of the maximum satisfiability problem for Horn formulas
• Probabilistic logic
• Probabilistic satisfiability
• The Problem of Simplifying Truth Functions
• The intractability of resolution

Cited in

(14)

• Perfect, ideal and balanced matrices
• scientific article; zbMATH DE number 5542984 (Why is no real title available?)
• (0, 1) ideal matrices
• Unified Characterisations of Resolution Hardness Measures
• \((0, \pm 1)\) ideal matrices
• Ideal clutters
• scientific article; zbMATH DE number 5050044 (Why is no real title available?)
• Balanced matrices
• Combining preorder and postorder resolution in a satisfiability solver
• Clean clutters and dyadic fractional packings
• Principles and Practice of Constraint Programming – CP 2003
• Using resolution for deciding solvable classes and building finite models
• Theory and Applications of Satisfiability Testing
• Perfect \(0,\pm 1\) matrices

This page was built for publication: Resolution and the integrality of satisfiability problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352293)