On subclasses of minimal unsatisfiable formulas
type: Item
instance of: scholarly article
title: On subclasses of minimal unsatisfiable formulas
zbMATH Open document ID: 0965.03016
DOI: 10.1016/S0166-218X(00)00245-6
author: Hans Kleine Büning
published in: Discrete Applied Mathematics
publication date: 2001-07-04T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 1565920
zbMATH Keywords: minimal unsatisfiability
zbMATH Keywords: propositional formulas
zbMATH Keywords: conjunctive normal form
MaRDI profile type: Publication
cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
cites work: The intractability of resolution
cites work: Q4263797
cites work: The complexity of facets resolved
cites work: The complexity of facets (and some facets of complexity)
cites work: Hard examples for resolution
full work available at URL: s0166-218x(00)00245-6
OpenAlex ID: W1978107969
Wikidata QID: Q127754366
description: scientific article; zbMATH DE number 1565920