Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
DOI10.1016/J.TCS.2020.08.032zbMATH Open1460.68099OpenAlexW3084255207MaRDI QIDQ2003999FDOQ2003999
Authors: 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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational learning theory (68Q32) Model theory of finite structures (03C13) Grammars and rewriting systems (68Q42) Computational aspects of satisfiability (68R07)
Cites Work
- Title not available (Why is that?)
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- An application of games to the completeness problem for formalized theories
- Title not available (Why is that?)
- Classifying regular events in symbolic logic
- On separation by locally testable and locally threshold testable languages
- Complexity of automaton identification from given data
- Exact DFA Identification Using SAT Solvers
- Inference of regular languages using state merging algorithms with search
- Regular inference as vertex coloring
- Efficient algorithms for the inference of minimum size DFAs
- Grammatical inference. Algorithms, routines and applications
- Learning subregular classes of languages with factored deterministic automata
- Cognitive and sub-regular complexity
- A continuous approach to inductive inference
- A SAT-based approach to learn explainable decision sets
- An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures
- Efficient symmetry breaking for SAT-based minimum DFA inference
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- BFS-based symmetry breaking predicates for DFA identification
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003999)
