Solving SAT problem by heuristic polarity decision-making algorithm (Q2465749): Difference between revisions

@@ Property / describes a project that uses @@
+MiniSat
@@ Property / describes a project that uses: MiniSat / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SATO
@@ Property / describes a project that uses: SATO / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11432-007-0070-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2046007623
@@ Property / OpenAlex ID: W2046007623 / rank @@
+Normal rank
@@ Property / cites work @@
+A discrete Lagrangian-based global-search method for solving satisfiability problems
+Normal rank
@@ Property / cites work @@
+BerkMin: A fast and robust SAT-solver
@@ Property / cites work: BerkMin: A fast and robust SAT-solver / rank @@
+Normal rank
@@ Property / cites work @@
+Solving propositional satisfiability problems
@@ Property / cites work: Solving propositional satisfiability problems / rank @@
+Normal rank