Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
DOI10.1016/j.tcs.2020.08.032zbMath1460.68099OpenAlexW3084255207MaRDI QIDQ2003999
Thiago Alves Rocha, Ana Teresa Martins, Francicleber Martins Ferreira
Publication date: 13 October 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.08.032
Computational learning theory (68Q32) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42) Model theory of finite structures (03C13) Computational aspects of satisfiability (68R07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular inference as vertex coloring
- A continuous approach to inductive inference
- Classifying regular events in symbolic logic
- Grammatical inference. Algorithms, routines and applications
- A SAT-based approach to learn explainable decision sets
- Efficient symmetry breaking for SAT-based minimum DFA inference
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- Inference of regular languages using state merging algorithms with search
- BFS-Based Symmetry Breaking Predicates for DFA Identification
- On Separation by Locally Testable and Locally Threshold Testable Languages
- An application of games to the completeness problem for formalized theories
- Solving SAT and SAT Modulo Theories
- Exact DFA Identification Using SAT Solvers
- Complexity of automaton identification from given data
- Cognitive and Sub-regular Complexity
- An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures
- Efficient algorithms for the inference of minimum size DFAs
This page was built for publication: Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
