Sugar

swMATH9758MaRDI QIDQ21737FDOQ21737

Author name not available (Why is that?)

Cited In (29)

• 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.
• Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
• 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
• Clingcon: The next generation
• Space-Efficient Planar Acyclicity Constraints
• Dynamic programming approach for solving the open shop problem
• A SAT Approach to Clique-Width
• aspeed: Solver scheduling via answer set programming
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Coupling different integer encodings for SAT
• Solving constraint satisfaction problems with SAT modulo theories
• 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
• URSA: A System for Uniform Reduction to SAT

This page was built for software: Sugar