CertiFOX: Certified First-Order Model Expansion

Informazioni relative al progetto

CertiFOX

ID dell’accordo di sovvenzione: 101122653

DOI

10.3030/101122653

Data della firma CE 14 Dicembre 2023

Data di avvio 1 Ottobre 2024

Data di completamento 30 Settembre 2029

Finanziato da

• European Research Council (ERC)

Costo totale

€ 1 999 928,75

Contributo UE

€ 1 999 928,75

Coordinato da

KATHOLIEKE UNIVERSITEIT LEUVEN
Belgium

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Peer reviewed articles (7)

Certified Branch-and-Bound MaxSAT Solving

Autori: Dieter Vandesande, Jordi Coll, Bart Bogaerts
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 40, 2026, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/AAAI.V40I17.38449

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach

Autori: Hannes Ihalainen, Dieter Vandesande, André Schidler, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 40, 2026, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/AAAI.V40I17.38439

Using Certifying Constraint Solvers for Generating Step-wise Explanations

Autori: Ignace Bleukx, Maarten Flippo, Bart Bogaerts, Emir Demirović, Tias Guns
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 40, 2026, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/AAAI.V40I17.38432

Towards a Certifying Grounder

Autori: Daimy Van Caudenberg, Alexander Ek, Carlos Cantero, Bart Bogaerts
Pubblicato in: Electronic Proceedings in Theoretical Computer Science, Numero 450, 2026, ISSN 2075-2180
Editore: Open Publishing Association
DOI: 10.4204/EPTCS.450.24

Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables

Autori: Markus Anders, Bart Bogaerts, Benjamin Bogø, Arthur Gontier, Wietze Koops, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Adrian Rebola-Pardo, Yong Kiam Tan
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 40, 2026, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/AAAI.V40I17.38426

Exploiting Symmetries in MUS Computation

Autori: Ignace Bleukx, Hélène Verhaeghe, Bart Bogaerts, Tias Guns
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 39, 2025, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/AAAI.V39I11.33209

Satsuma: Structure-Based Symmetry Breaking in SAT

Autori: Markus Anders, Sofia Brenner, Gaurav Rattan
Pubblicato in: Journal of Artificial Intelligence Research, Numero 85, 2026, ISSN 1076-9757
Editore: AI Access Foundation
DOI: 10.1613/JAIR.1.18744

Book chapters (8)

Hardware Model Checking Certification with Certifaiger and Cerbtora

Autori: Nils Froleyks, Emily Yu
Pubblicato in: Lecture Notes in Computer Science, Automated Reasoning, 2026
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-32589-1_17

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation

Autori: Daimy Van Caudenberg, Bart Bogaerts, Leandro Vendramin
Pubblicato in: Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems, 2025
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-90653-4_1

Ethos: A Fast Proof Checker for the Eunoia Logical Framework

Autori: Andrew Reynolds, Hans-Jörg Schurr, Mallku Soldevila, Haniel Barbosa, Clark Barrett, Cesare Tinelli
Pubblicato in: Lecture Notes in Computer Science, Automated Reasoning, 2026
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-32589-1_19

The Cooperating Proof Calculus: Comprehensive Proofs for an SMT Solver

Autori: Andrew Reynolds, Hans-Jörg Schurr, Haniel Barbosa, Ofec Israel, Jibiana Zoe Jakpor, Hanna Lachnitt, Abdalrhman Mohamed, Aina Niemetz, Mathias Preiner, Yoni Zohar, Robert Jones, Clark Barrett, Cesare Tinelli
Pubblicato in: Lecture Notes in Computer Science, Computer Aided Verification, 2026
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-32526-6_9

Certifying Constraints in Hardware Model Checking

Autori: Nils Froleyks, Emily Yu, Armin Biere, Keijo Heljanko
Pubblicato in: Lecture Notes in Computer Science, Formal Methods, 2026
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-26204-2_9

Liveness Proofs for Hardware Model Checking

Autori: Nils Froleyks, Emily Yu, Bart Bogaerts, Armin Biere, Keijo Heljanko
Pubblicato in: Lecture Notes in Computer Science, Computer Aided Verification, 2026
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-32537-2_1

Advances in STV Margin Computation

Autori: Michelle Blom, Alexander Ek, Peter J. Stuckey, Vanessa Teague, Damjan Vukcevic
Pubblicato in: Lecture Notes in Computer Science, Electronic Voting, 2026
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-39512-2_1

Certifying Pareto Optimality in Multi-objective Maximum Satisfiability

Autori: Christoph Jabs, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
Pubblicato in: Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems, 2025
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-90653-4_6

Conference proceedings (2)

On Symmetries and Transformations

Autori: Daimy Van Caudenberg and Markus Anders and Bart Bogaerts
Pubblicato in: 2026
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/LIPICS.CP.2026.54

Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets

Autori: Hannes Ihalainen and Jeremias Berg and Matti Jarvisalo and Bart Bogaerts
Pubblicato in: 2025
Editore: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/LIPICS.CP.2025.15