Learning a subclass of k-quasi-Horn formulas with membership queries

Puente, Víctor Lavín

doi:10.1016/j.ipl.2011.03.008

Cited by 2 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The target class used in [15] to prove non-learnability, using equivalence queries alone, of the class H MV F (Theorem 3.2) is contained in ARF MV F. (Formulas in H MV F contain f d clauses and mvd clauses with unrestricted antecedents. )…”

Section: Theoremmentioning

confidence: 99%

See 1 more Smart Citation

Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries

Puente

2015

Theory Comput Syst

Self Cite

View full text Add to dashboard Cite

Identifying dependencies that hold in relational databases is essential to produce good databases designs. In particular, functional and multivalued dependencies are used to obtain relation schemes that satisfy the 4th normal form, a property that is considered satisfactory for most applications. It is known that the class of sets of functional dependencies is learnable in the exact model of learning with queries. Also a subclass of multivalued dependencies, the class of consequent-restricted multivalued dependencies, has been shown to be learnable in this model. In this paper, we present an algorithm that learns a class that contains sets of both functional and multivalued dependencies under some restrictions imposed on the antecedents of dependencies. We also show, as a by-product, an algorithm that learns a non-trivial subclass of 2-quasi Horn formulas, closely related to the class just mentioned.

show abstract

Section: Theoremmentioning

confidence: 99%

“…Proof Though we use here a class similar to that of Theorem 3.1 in [15], the proof is slightly different since we are dealing now with sets of dependencies instead of formulas.…”

Section: Theoremmentioning

confidence: 99%