Logic and Learning an Algebra and Finite Model Theory Approach
Computational learning theory is a branch of computer science that studies the mathematical and algorithmic underpinnings of machine learning. It provides the concepts and methods to classify the computational feasibility of diffe...
ver más
¿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
PID2019-108991GB-I00
MATEMATICAS PARA EL DESARROLLO DE SISTEMAS INTELIGENTES
76K€
Cerrado
FRESCO
Fast and Reliable Symbolic Computation
2M€
Cerrado
TIN2015-70266-C2-1-P
TECNICAS COMPUTACIONALES ALGEBRAICAS Y DIFUSAS PARA LA SOCIE...
56K€
Cerrado
ARiAT
Advanced Reasoning in Arithmetic Theories
1M€
Cerrado
Fecha límite de participación
Sin fecha límite de participación.
Descripción del proyecto
Computational learning theory is a branch of computer science that studies the mathematical and algorithmic underpinnings of machine learning. It provides the concepts and methods to classify the computational feasibility of different learning problems. This project lies at the intersection of computational learning theory and logic, and it builds on recently identified new connections between learning theory and universal algebra. Its high-level goals are (i) to improve our understanding of learnability for fragments of first-order logic, motivated by applications in data management and knowledge representation, and (ii) to further develop and exploit the recently identified connections with universal algebra (as well as combinatorial graph theory, finite model theory, and fixed point logics), to developing a rich technical framework for proving new results. More concretely, we will study aspects of computational learning theory for fragments of first order logic under constraints (that is, in the presence of a background theory), with applications in data management and knowledge representation.