Artículo:
Learning a Subclass of Multivalued Dependencies Formulas from Entailments

Fecha

2015-09-15

Editor

Sistedes

Publicado en

Actas de las XV Jornadas de Programación y Lenguajes (PROLE 2015)

Licencia Creative Commons

Resumen

Functional and multivalued dependencies play an important role in the design of relational databases. There is a strong connection between data dependencies and some fragments of the propositional logic. In particular, functional dependencies are closely related to Horn formulas. Also, multivalued dependencies are characterized in terms of multivalued formulas. It is known that both Horn formulas and sets of functional dependencies are efficiently learnable in the exact model of learning with queries. In this work, we study the learnability of a non-trivial subclass of multivalued formulas called CRMVDF. We use Angluin’s exact learning model with membership and equivalence queries and present a polynomial time algorithm which exactly learns CRMVDF from entailments.

Descripción

Acerca de Hermo, Montserrat

Palabras clave

Página completa del ítem
Notificar un error en este artículo
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX