GRASP: A Search Algorithm for Propositional Satisfiability.

Marques-Silva, J. P., & Sakallah, K. A. (1999). GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers, 48(5), 506-521.

Type

Journal article

Intellectual base

Primary research

Year

1999

Volume

48

Issue

5

Pages

506-521

DOI

10.1109/12.769433

DOI registrant

Institute of Electrical and Electronics Engineers

Link

https://doi.org/10.1109/12.769433

Cited from

computer_science

Cited by

1 citation across 1 artifact.

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

Primes

• Stack
  • The backtracking-search stack transferred from the DPLL algorithm into modern SAT and SMT solvers, where CDCL manipulates the stack with clause learning.

    This sourceDevelops conflict-driven clause learning (CDCL) extending the backtracking DPLL stack in modern SAT solvers.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:aafa301a713d · see in the full table