Clause weighting local search for SAT
type: Item
instance of: scholarly article
title: Clause weighting local search for SAT
zbMATH Open document ID: 1109.68106
author: N. E. Zubov
published in: Journal of Automated Reasoning
publication date: 2007-01-24T00:00:00Z
full work available at URL: http://hdl.handle.net/10072/13781
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5118126
zbMATH Keywords: propositional satisfiability testing
zbMATH Keywords: multiplicative algorithm
zbMATH Keywords: pure additive weighting scheme
describes a project that uses: Chaff
MaRDI profile type: Publication
OpenAlex ID: W2027789671
cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
cites work: Q5472387
cites work: Theory and Applications of Satisfiability Testing
cites work: Local search characteristics of incomplete SAT procedures
cites work: A discrete Lagrangian-based global-search method for solving satisfiability problems
cites work: Q4415201
DOI: 10.1007/S10817-005-9010-1
description: scientific article; zbMATH DE number 5118126