Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques

DOI10.1007/S10601-007-9022-ZzbMATH Open1211.68386OpenAlexW1994152502MaRDI QIDQ2385178FDOQ2385178

Mirosław Truszczyński, Lengning Liu

Publication date: 11 October 2007

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-007-9022-z

Recommendations

• Search techniques for SAT-based Boolean optimization
• scientific article; zbMATH DE number 5139167
• scientific article; zbMATH DE number 5139168
• scientific article; zbMATH DE number 5139161
• Local-search techniques for propositional logic extended with cardinality constraints

zbMATH Keywords

stochastic local searchBoolean satisfiabilitypseudo-Boolean constraints

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in computer science (03B70)

Cites Work

• BerkMin: A fast and robust SAT-solver
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Principles and Practice of Constraint Programming – CP 2003

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incomplete dynamic backtracking for linear pseudo-Boolean problems
• Title not available (Why is that?)
• Reformulation based MaxSat robustness
• Title not available (Why is that?)

Uses Software

• Walksat
• SATO
• PBS
• WSAT(OIP)
• Chaff
• BerkMin

This page was built for publication: Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques

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