satisfiability problem

Boolean, T. (1971). satisfiability problem.

Retired. This entry was not a citation. Our extractor stored an inline prose definition from the article as though it were a bibliographic record: the title names a concept rather than a published work, and the citation text names no work at all. The page is kept because links to it still resolve, but it is withdrawn from the reference list. This entry is kept so the citations that pointed at it still resolve, and so the correction is visible rather than silent.

Type

Unclassified

Intellectual base

Unclassified

Year

1971

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Mechanisms

• Constraint-Solver Backsolve
  • Many inverse problems are computationally hard — the satisfiability core is NP-complete

    This sourceEnumerating all solutions is at least as hard, which is why a faithful backsolve can be intractable and why the temptation to drop the completeness guarantee is the mechanism's central hazard.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:20d4bf63cdd6 · see in the full table