Polynomial-Time Implicit Learnability in SMT.
Ionela G. MocanuVaishak BelleBrendan JubaPublished in: ECAI (2020)
Keyphrases
- finite automata
- dnf formulas
- equivalence queries
- boolean functions
- exact learning
- monotone dnf formulas
- equivalence and membership queries
- membership queries
- uniform distribution
- learning algorithm
- statistical machine translation
- special case
- positive data
- computational complexity
- dnf formulae
- read once formulas
- grammatical inference
- uniform convergence
- agnostic learning
- efficient learning
- worst case
- approximation algorithms
- polynomial size
- term dnf
- pac learnability
- pattern languages
- linear separability
- natural language
- regular expressions