A Preprocessor for Max-SAT Solvers (Q3502688)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A Preprocessor for Max-SAT Solvers	scientific article

Statements

scholarly article

0 references

A Preprocessor for Max-SAT Solvers (English)

0 references

0 references

0 references

0 references

Theory and Applications of Satisfiability Testing – SAT 2008

0 references

publication date

27 May 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-79719-7_2

0 references

Theory and Applications of Satisfiability Testing

0 references

Exact Max-SAT solvers for over-constrained problems

0 references

A Complete Calculus for Max-SAT

0 references

On Solving the Partial MAX-SAT Problem

0 references

0 references

Local Consistency in Weighted CSPs and Inference in Max-SAT

0 references

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-79719-7_2

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3502688

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3502688&oldid=35058038"