Theory and Applications of Satisfiability Testing

DOI10.1007/B137280MaRDI QIDQ5713704zbMATH OpenOpenAlexFDO

Authors Josep Argelich, Felip Manya

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Exact Max-SAT solvers for over-constrained problems
• Solving Max-SAT as weighted CSP
• Minimaxsat: an efficient weighted Max-SAT solver
• Current approaches for solving over-constrained problems
• scientific article; zbMATH DE number 956866

Cited in

(5)

• Current approaches for solving over-constrained problems
• Exact Max-SAT solvers for over-constrained problems
• Speeding up the constraint-based method in difference logic
• scientific article; zbMATH DE number 2080338 (Why is no real title available?)
• scientific article; zbMATH DE number 2084715 (Why is no real title available?)

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713704)