Two tractable subclasses of minimal unsatisfiable formulas (Q1961649): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The complexity of facets resolved / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of facets (and some facets of complexity) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solvable matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank | |||
Normal rank | |||
Latest revision as of 11:25, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two tractable subclasses of minimal unsatisfiable formulas |
scientific article |
Statements
Two tractable subclasses of minimal unsatisfiable formulas (English)
0 references
28 February 2000
0 references
simplification procedure
0 references
satisfiability test
0 references
splitting
0 references
collapsing
0 references
conjunctive normal form
0 references
minimal unsatisfiability
0 references
polynomial time
0 references
