Cited in
(62)- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- The state of SAT
- Solving satisfiability problems with preferences
- Satisfiability modulo the theory of costs: foundations and applications
- Theory and Applications of Satisfiability Testing
- Breaking instance-independent symmetries in exact graph coloring
- Properties and applications of programs with monotone and convex constraints
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- New Encodings of Pseudo-Boolean Constraints into CNF
- Best-First AND/OR Search for 0/1 Integer Programming
- Dependence graph based verification and synthesis of hardware/software co-designs with SAT related formulation
- Recent Advances in Constraints
- Boolean lexicographic optimization: algorithms \& applications
- Probability logic and optimization SAT: The PSAT and CPA models
- Dynamic symmetry-breaking for Boolean satisfiability
- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
- Haplotype inference with pseudo-Boolean optimization
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Algorithms for Weighted Boolean Optimization
- OptSAT
- Pueblo
- SDSAT
- UnitWalk
- CP-nets
- Saturn
- MaxSolver
- NP-SPEC
- MAX-2-SAT
- QingTing1
- SATO
- SATIRE
- OPBDP
- WSAT(OIP)
- RPOLY
- BerkMin
- ComFoRT
- ToulBar2
- OPIUM
- MiniMaxSat
- MSUnCore
- Leibniz
- Velev SAT Benchmarks
- Exact algorithms for MAX-SAT
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- Shatter
- SDSAT: Tight integration of small domain encoding and lazy approaches in solving difference logic.
- Tools for modeling and solving search problems
- Variants of LTL query checking
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- Iterative and core-guided maxsat solving: a survey and assessment
- Logic programs with monotone abstract constraint atoms
- Curriculum-based course timetabling with SAT and MaxSAT
- Search techniques for SAT-based Boolean optimization
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- Efficient verification of sequential and concurrent C programs
- Local-search techniques for propositional logic extended with cardinality constraints
- Strong equivalence of logic programs with abstract constraint atoms
- Solution and Optimization of Systems of Pseudo-Boolean Constraints
- A SAT approach to query optimization in mediator systems
This page was built for software: PBS
