Sugar

swMATH9758MaRDI QIDQ21737

No author found.

Related Items (29)

Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays ⋮ URSA: A System for Uniform Reduction to SAT ⋮ Compiling finite linear CSP into SAT ⋮ Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint ⋮ Coupling different integer encodings for SAT ⋮ Promoting robust black-box solvers through competitions ⋮ Automatically improving constraint models in Savile Row ⋮ A SAT Approach to Clique-Width ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ aspeed: Solver scheduling via answer set programming ⋮ Clingcon: The next generation ⋮ Constraint programming for planning test campaigns of communications satellites ⋮ Compiling Finite Linear CSP into SAT ⋮ Constraint CNF: SAT and CSP Language Under One Roof. ⋮ Automatic generation of basis test paths using variable length genetic algorithm ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Propagation via lazy clause generation ⋮ Dynamic programming approach for solving the open shop problem ⋮ Space-Efficient Planar Acyclicity Constraints ⋮ Constraint Answer Set Programming Systems ⋮ meSAT: multiple encodings of CSP to SAT ⋮ The possibilistic Horn non-clausal knowledge bases

This page was built for software: Sugar