Generalizing Core-Guided Max-SAT (Q3637181)

From MaRDI portal

Revision as of 18:58, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Generalizing Core-Guided Max-SAT	scientific article

Statements

scholarly article

0 references

Generalizing Core-Guided Max-SAT (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-02777-2_44

0 references

Mark H. Liffiton

0 references

Karem A. Sakallah

0 references

Lecture Notes in Computer Science

0 references

publication date

7 July 2009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-02777-2_44

0 references

0 references

0 references

Consistent subsets of inconsistent systems: structure and behaviour

0 references

Theory and Applications of Satisfiability Testing

0 references

On Solving the Partial MAX-SAT Problem

0 references

Theory and Applications of Satisfiability Testing

0 references

Algorithms for computing minimal unsatisfiable subsets of constraints

0 references

Searching for Autarkies to Trim Unsatisfiable Clause Sets

0 references

Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3637181

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