Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT.
Thiago Alves RochaAna Teresa C. MartinsFrancicleber Martins FerreiraPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- efficient learning
- quantifier free
- boolean formula
- membership queries
- quantifier elimination
- first order logic
- rewrite systems
- learning algorithm
- real numbers
- term rewriting
- boolean satisfiability
- uniform distribution
- natural language
- theorem proving
- relational data model
- sat solvers
- cardinality constraints
- constraint databases
- pac learning
- theorem prover
- knowledge representation
- np complete
- learning theory
- propositional logic
- linear constraints
- practical problems
- constraint propagation
- sat problem
- conjunctive normal form
- functional programming
- boolean functions
- boolean variables
- database
- active rules
- relational databases
- satisfiability modulo theories
- np hard