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

LASD

Financiado

Logic and Automata over Sequences with Data

Formal language theory is indisputably one of the most successful theories in theoretical computer science with many applications in such fields as formal verification, programming languages, and databases, to name a few. Despite... ver más

31/07/2028

RHEINLAND-PFALZISC...

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

RHEINLAND-PFALZISCHE TECHNISCHE UNIVERSITAT No se ha especificado una descripción o un objeto social para esta compañía.

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2023-05-25

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

I+D

Cerrada hace 2 años

0% 100% 100%

1 Participantes

RHEINLAND-PFALZISCHE TECHNIS...

2.00M€ | Lider

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

Proyectos interesantes

ANT Automata in Number Theory 1M€ Cerrado

TIN2010-20967-C04-03 TEORIA, APLICACIONES Y SINERGIA EN SAT, CSP Y FDL 77K€ Cerrado

TIN2015-70266-C2-1-P TECNICAS COMPUTACIONALES ALGEBRAICAS Y DIFUSAS PARA LA SOCIE... 56K€ Cerrado

TIN2009-14562-C05-04 FEAST: FUNDAMENTOS Y EXTENSIONES DE LA TECNOLOGIA ANSWER SET... 141K€ Cerrado

TIN2009-14348 CAPACIDAD EXPRESIVA DE LAS LOGICAS DE ARBOLES 4K€ Cerrado

TIN2010-20967-C04-01 TASSAT: TEORIA, APLICACIONES Y SINERGIA EN SAT, CSP Y FDL 37K€ Cerrado

Duración del proyecto: 62 meses Fecha Inicio: 2023-05-25
Fecha Fin: 2028-07-31

Líder del proyecto

RHEINLAND-PFALZISCHE TECHNISCHE UNIVERSITAT No se ha especificado una descripción o un objeto social para esta compañía.

Presupuesto del proyecto 2M€

Descripción del proyecto Formal language theory is indisputably one of the most successful theories in theoretical computer science with many applications in such fields as formal verification, programming languages, and databases, to name a few. Despite this, the standard restriction to finite alphabets has been a limiting factor in the applicability of the theory in various important application domains, wherein sequences with data (i.e. ranging over an infinite domain like the set of integers and the set of strings) naturally arise. This has motivated an extensive study of automata over infinite alphabets in the last three decades, which aims to develop algorithms for analyzing data languages. It was, however, quickly realized that permitting anything but the simplest data reasoning results in undecidability for the most fundamental models in the theory. Given the growing practical needs for tools for reasoning about sequences with data, it is crucial that we break through this undecidability barrier. The aim of the project is to overcome the current undecidability barrier in extending automata theory over infinite alphabets with complex data reasoning. The first concrete objective is, thus, to identify new decidable logic/automata models for data languages that permit complex data reasoning over various data domains (e.g. integer linear arithmetic, real-closed fields, string constraints, etc.), and to develop efficient algorithms for analyzing them. In addition to making fundamental theoretical contributions in automata theory over infinite alphabets, I also aim to address the current practical needs for tools for reasoning about sequences. Thus, the second objective of the project is to transfer new algorithmic insights to the following important application domains: (1) querying graph databases, (2) verification of list-manipulating programs, and (3) interpretable machine learning for sequences.

Conecta tu I+D

Entra hoy

¿Olvide mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores