New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
type: Item
instance of: scholarly article
title: New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
zbMATH Open document ID: 1140.68492
author: Renato Bruni
author: Andrea Santori
published in: Discrete Optimization
publication date: 2008-08-15T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5312361
zbMATH Keywords: branching rules
zbMATH Keywords: conflict-based search frameworks
zbMATH Keywords: satisfiability
describes a project that uses: BerkMin
describes a project that uses: zChaff
describes a project that uses: Chaff
describes a project that uses: Leibniz
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.10.012
OpenAlex ID: W2021747739
cites work: Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
cites work: Q4431379
cites work: Q4255462
cites work: The complexity of theorem-proving procedures
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Q4198056
cites work: SAT2000. Highlights of satisfiability research in the year 2000. 3rd international workshop, September 1998
cites work: BerkMin: A fast and robust SAT-solver
cites work: Q3145805
cites work: Theory and Applications of Satisfiability Testing
cites work: Solving propositional satisfiability problems
cites work: On the complexity of choosing the branching literal in DPLL
cites work: Q4705311
cites work: Q4809068
cites work: Implementing the Davis-Putnam method
DOI: 10.1016/J.DISOPT.2006.10.012
Recommended article: DPLL: The Core of Modern Satisfiability Solvers
Recommended article: Learning to select branching rules in the DPLL procedure for satisfiability
Recommended article: Q3634956
Recommended article: A refined branching algorithm for the maximum satisfiability problem
Recommended article: An Incremental Branch-and-Bound Method for the Satisfiability Problem
Recommended article: New algorithms for exact satisfiability
description: scientific article; zbMATH DE number 5312361