Publicaciones (87) Publicaciones de CARLOS J. ANSOTEGUI GIL

2024

  1. Effectively computing high strength mixed covering arrays with constraints

    Journal of Parallel and Distributed Computing, Vol. 185

  2. ePyDGGA: automatic configuration for fitting epidemic curves

    Scientific Reports, Vol. 14, Núm. 1

2023

  1. Encoding Ethics to Compute Value-Aligned Norms

    Minds and Machines, Vol. 33, Núm. 4, pp. 761-790

  2. Exploiting Configurations of MaxSAT Solvers

    Leibniz International Proceedings in Informatics, LIPIcs

  3. Interpretable decision trees through MaxSAT

    Artificial Intelligence Review, Vol. 56, Núm. 8, pp. 8303-8323

2022

  1. Boosting evolutionary algorithm configuration

    Annals of Mathematics and Artificial Intelligence, Vol. 90, Núm. 7-9, pp. 715-734

  2. Incomplete MaxSAT approaches for combinatorial testing

    Journal of Heuristics, Vol. 28, Núm. 4, pp. 377-431

  3. OptiLog V2: Model, Solve, Tune and Run

    Leibniz International Proceedings in Informatics, LIPIcs

  4. Scale-Free Random SAT Instances

    Algorithms, Vol. 15, Núm. 6

  5. Yet Another (Fake) Proof of P=NP

    Frontiers in Artificial Intelligence and Applications

2021

  1. Building high strength mixed covering arrays with constraints

    Leibniz International Proceedings in Informatics, LIPIcs

  2. Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. OptiLog: A Framework for SAT-based Systems

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. PyDGGA: Distributed GGA for Automatic Configuration

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  5. Reducing SAT to Max2SAT

    IJCAI International Joint Conference on Artificial Intelligence

2019

  1. Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Community structure in industrial SAT instances

    Journal of Artificial Intelligence Research, Vol. 66, pp. 443-472

  3. Hyper-reactive Tabu search for MaxSAT

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Phase transition in realistic random SAT models

    Frontiers in Artificial Intelligence and Applications

2018

  1. Exploiting Moral Values to Choose the Right Norms

    AIES 2018 - Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society