Solving SAT problem by heuristic polarity decision-making algorithm (Q2465749): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A discrete Lagrangian-based global-search method for solving satisfiability problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: BerkMin: A fast and robust SAT-solver / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving propositional satisfiability problems / rank | |||
Normal rank | |||
Latest revision as of 13:47, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving SAT problem by heuristic polarity decision-making algorithm |
scientific article |
Statements
Solving SAT problem by heuristic polarity decision-making algorithm (English)
0 references
7 January 2008
0 references
SAT problem
0 references
DPLL
0 references
complete algorithm
0 references
decision-making
0 references
