Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
From MaRDI portal
Publication:2385178
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
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?)
- Stochastic local search. Foundations and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local-search techniques for propositional logic extended with cardinality constraints
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tools for modeling and solving search problems
- Incomplete dynamic backtracking for linear pseudo-Boolean problems
- Title not available (Why is that?)
- Reformulation based MaxSat robustness
- Title not available (Why is that?)
- Local-search techniques for propositional logic extended with cardinality constraints
- Search techniques for SAT-based Boolean optimization
Uses Software
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)
