( en | de | ru )

 

Disambiguation of "Ansótegui, Carlos"

Author of the publication

copydeleteadd this publication to your clipboard
Modeling Choices in Quasigroup Completion: SAT vs. CSP.

, , , , and . AAAI, page 137-142. AAAI Press / The MIT Press, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Carlos Briede

Carlos Rodríguez

Carlos Schleipen

Carlos Strunz

Carlos Maya

 

Other publications of authors with the same name

Resolution procedures for multiple-valued optimization., , , and . Inf. Sci., (2013)MaxSAT by improved instance-specific algorithm configuration., , , and . Artif. Intell., (2016)A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms., , and . CP, volume 5732 of Lecture Notes in Computer Science, page 142-157. Springer, (2009)Edge Matching Puzzles as Hard SAT/CSP Benchmarks., , , and . CP, volume 5202 of Lecture Notes in Computer Science, page 560-565. Springer, (2008)Improving SAT-Based Weighted MaxSAT Solvers., , , and . CP, volume 7514 of Lecture Notes in Computer Science, page 86-101. Springer, (2012)The Community Structure of SAT Formulas., , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 410-423. Springer, (2012)On the Density of States of Boolean Formulas., , and . CCIA, volume 375 of Frontiers in Artificial Intelligence and Applications, page 369-382. IOS Press, (2023)Yet Another (Fake) Proof of P=NP., and . CCIA, volume 356 of Frontiers in Artificial Intelligence and Applications, page 25-34. IOS Press, (2022)Reducing SAT to Max2SAT., and . IJCAI, page 1367-1373. ijcai.org, (2021)A New Approach to Solving SAT-Encoded Binary CSPs.. CP, volume 2833 of Lecture Notes in Computer Science, page 962. Springer, (2003)