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