The following pages link to Carlos Ansótegui (Q274401):
Displaying 23 items.
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- SAT-based MaxSAT algorithms (Q360042) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers (Q1697332) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← links)
- PyDGGA: distributed GGA for automatic configuration (Q2118281) (← links)
- Boosting evolutionary algorithm configuration (Q2163844) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Exploiting multivalued knowledge in variable selection heuristics for SAT solvers (Q2385440) (← links)
- Resolution procedures for multiple-valued optimization (Q2510176) (← links)
- The Community Structure of SAT Formulas (Q2843344) (← links)
- The Fractal Dimension of SAT Formulas (Q3192184) (← links)
- Using Community Structure to Detect Relevant Learnt Clauses (Q3453229) (← links)
- Boosting Open CSPs (Q3524246) (← links)
- Mapping CSP into Many-Valued SAT (Q3612452) (← links)
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178) (← links)
- (Q4583798) (← links)
- Community Structure in Industrial SAT Instances (Q5235475) (← links)
- Theory and Applications of Satisfiability Testing (Q5714742) (← links)
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (Q5756570) (← links)
- Scale-Free Random SAT Instances (Q6290396) (← links)
