Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

CertiFOX

Financiado

Cerrado

CertiFOX: Certified First-Order Model Expansion

The field of combinatorial optimization is concerned with developing generic tools that take a declarative problem description and automatically compute an optimal solution to it. Often, users specify their problem in a high-level... ver más

30/09/2029

KU Leuven

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

KATHOLIEKE UNIVERSITEIT LEUVEN No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2024-10-01

ERC-2023-COG: ERC CONSOLIDATOR GRANTS Scope:Objectives

I+D

Cerrada hace 2 años

0% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

Participantes

KU Leuven

Lider

Proyectos interesantes

PID2021-126605NB-I00

Software

Data Analytics

127K€ Cerrado

RTI2018-095609-B-I00

Software

Data Analytics

22K€ Cerrado

TIN2012-33042

Software

Artificial Inte...

24K€ Cerrado

EIN2020-112308

Software

Artificial Inte...

10K€ Cerrado

TIN2013-45732-C4-3-P

Software

Data Science

36K€ Cerrado

BES-2013-062658

Software

Data Science

84K€ Cerrado

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Duración del proyecto: 59 meses Fecha Inicio: 2024-10-01
Fecha Fin: 2029-09-30

Líder del proyecto

KATHOLIEKE UNIVERSITEIT LEUVEN No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto The field of combinatorial optimization is concerned with developing generic tools that take a declarative problem description and automatically compute an optimal solution to it. Often, users specify their problem in a high-level, human-understandable formal language. This specification is first translated into a low-level specification a solver understands and subsequently solved. Thanks to tremendous progress in solving technology, we can now solve a wide variety of NP-hard (or worse) problems in practice. Moreover, these tools are increasingly used in real-life applications, including high-value and life-affecting decisions. Therefore, it is of utmost importance that they be completely reliable. The central objective of this proposal is to develop methodologies and tools with which we can guarantee with 100% certainty that the right problem has been solved correctly. To achieve this ambitious objective, I will build on recent breakthroughs in proof logging, where solvers do not just output an answer, but also a proof (or certificate) of correctness. However, a major limitation of current techniques is that correctness is not proven relative to the human-understandable specification written by the user, but relative to the low-level translation that the solver receives, meaning that there is no guarantee that the solver is solving the original problem. In this project, I will investigate end-to-end guarantees of correctness. When successful, this will have a major impact on the way combinatorial optimization software is developed, evaluated, and used: the proofs produced will enable (1) debugging, since proofs contain detailed information about where bugs occurred, (2) auditability, since proofs can be stored and checked by an independent third party, and even (3) rigorous evaluation of algorithmic improvements (I, for instance, have first-hand experience of winning a solver competition due to a bug that would have been caught easily using proof logging).

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores