swMATH9758MaRDI QIDQ21737FDOQ21737
Author name not available (Why is that?)
Official website: http://bach.istc.kobe-u.ac.jp/sugar/
Cited In (45)
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- The possibilistic Horn non-clausal knowledge bases
- Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays
- meSAT: multiple encodings of CSP to SAT
- Constraint CNF: SAT and CSP Language Under One Roof.
- Space-efficient planar acyclicity constraints. A declarative pearl
- Constraint answer set programming systems
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- Compiling Finite Linear CSP into SAT
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Automatic generation of basis test paths using variable length genetic algorithm
- Promoting robust black-box solvers through competitions
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Dynamic programming approach for solving the open shop problem
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Gecode
- Cadmium
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- CaSPER
- Clingcon
- Azucar
- URBiVA
- Proteus
- MINION
- Beam-ACO
- SIMPLY
- fzn2smt
- ArgoTriCS
- ESRA
- TCAS
- Essence
- meSAT
- asprin
- Coupling different integer encodings for SAT
- Solving constraint satisfaction problems with SAT modulo theories
- URSA: a system for uniform reduction to SAT
- Propagation via lazy clause generation
- Automatically improving constraint models in Savile Row
- Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint
- Compiling finite linear CSP into SAT
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Constraint programming for planning test campaigns of communications satellites
- \textit{clingcon}: the next generation
- aspeed: solver scheduling via answer set programming
This page was built for software: Sugar
