The \(Multi\)-SAT algorithm
type: Item
instance of: scholarly article
title: The \(Multi\)-SAT algorithm
zbMATH Open document ID: 0937.68149
DOI: 10.1016/S0166-218X(99)00035-9
author: J. Gu
published in: Discrete Applied Mathematics
publication date: 2000-03-09T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1389866
zbMATH Keywords: Multi-SAT algorithm
describes a project that uses: Walksat
describes a project that uses: DIMACS
MaRDI profile type: Publication
cites work: Q4091421
cites work: Binary Decision Diagrams
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Many hard examples for resolution
cites work: Backtrack programming techniques
cites work: Some results and experiments in programming techniques for propositional logic
cites work: A fast parallel SAT-solver -- efficient workload balancing
cites work: An Average Time Analysis of Backtracking
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Average Time Analysis of Clause Order Backtracking
cites work: A parallel approach for theorem proving in propositional logic
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
cites work: On the complexity of regular resolution and the Davis-Putnam procedure
cites work: Q4198056
cites work: A satisfiability tester for non-clausal propositional calculus
cites work: Q3789107
cites work: A Proof Method for Quantification Theory: Its Justification and Realization
cites work: Average time analyses of simplified Davis-Putnam procedures
cites work: Q4525708
cites work: Q4859227
cites work: Q4375757
cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience
cites work: Branch-and-cut solution of inference problems in propositional logic
cites work: Refutational theorem proving using term-rewriting systems
cites work: An average case analysis of a resolution principle algorithm in mechanical theorem proving.
cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time
cites work: Solving propositional satisfiability problems
cites work: Computational experience with an interior point algorithm on the satisfiability problem
cites work: Q5628016
cites work: Q4139711
cites work: Q3856120
cites work: Q4739657
cites work: The Pure Literal Rule and Polynomial Average Time
cites work: Q4375758
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Parallel consistent labeling algorithms
cites work: The complexity of satisfiability problems
cites work: Q3491010
cites work: Fast search algorithms for the n-queens problem
cites work: Q5593816
cites work: Q3732977
full work available at URL: s0166-218x(99)00035-9
OpenAlex ID: W2055762574
description: scientific article; zbMATH DE number 1389866