Richard J. Büchi
1960
Weak Second-Order Arithmetic and Finite Automata
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik
6
1-6
66–92
10.1002/malq.19600060105
Luc De Raedt
2008
Logical and relational learning
Springer Science & Business Media
10.1007/978-3-540-68856-3
Heinz-Dieter Ebbinghaus
Jörg Flum
1995
Finite model theory
Perspectives in Mathematical Logic
Springer
10.1007/978-3-662-03182-7
Heinz-Dieter Ebbinghaus
Jörg Flum
Wolfgang Thomas
1994
Mathematical Logic (2. ed.)
Undergraduate texts in mathematics
Springer
10.1007/978-1-4757-2355-7
Andrzej Ehrenfeucht
1961
An application of games to the completeness problem for formalized theories
Fundamenta Mathematicae
49
2
129–141
10.4064/fm-49-2-129-141
Erich Grädel
P. G. Kolaitis
L. Libkin
M. Marx
J. Spencer
Moshe Y. Vardi
Y. Venema
Scott Weinstein
2005
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
Springer-Verlag New York, Inc.
Secaucus, NJ, USA
10.1007/3-540-68804-8
Martin Grohe
Christof Löding
Martin Ritzert
2017
Learning MSO-definable hypotheses on strings
International Conference on Algorithmic Learning Theory
434–451
Martin Grohe
Martin Ritzert
2017
Learning first-order definable concepts over structures of small degree
32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)
IEEE
1–12
10.1109/LICS.2017.8005081
Colin De la Higuera
2010
Grammatical inference: learning automata and grammars
Cambridge University Press
10.1017/CBO9781139194655
John E. Hopcroft
Rajeev Motwani
Jeffrey D. Ullman
2006
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Addison-Wesley Longman Publishing Co., Inc.
Boston, MA, USA
Charles Jordan
Łukasz Kaiser
2013
Experiments with reduction finding
International Conference on Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science
7962
Springer
192–207
10.1007/978-3-642-39071-5_15
Charles Jordan
Lukasz Kaiser
2013
Learning programs as logical queries
Workshop on Learning Theory and Complexity, LTC
Łukasz Kaiser
2012
Learning Games from Videos Guided by Descriptive Complexity
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence
AAAI'12
AAAI Press
963–969
Angelo Montanari
Alberto Policriti
Nicola Vitacolonna
2005
An algorithmic account of Ehrenfeucht games on labeled successor structures
International Conference on Logic for Programming Artificial Intelligence and Reasoning
Springer
139–153
10.1007/11591191_11
Stephen Muggleton
1991
Inductive logic programming
New generation computing
8
4
295–318
10.1007/BF03037089
Elena Pezzoli
1998
Computational complexity of Ehrenfeucht-Fraïssé games on finite structures
International Workshop on Computer Science Logic
Springer
159–170
10.1007/10703163_11
Thiago Alves Rocha
Ana Teresa Martins
Francicleber Martins Ferreira
2018
On Distinguishing Sets of Structures by First-Order Sentences of Minimal Quantifier Rank
13th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2018)
to appear
Thiago Alves Rocha
Ana Teresa Martins
Francicleber Martins Ferreira
2018
Synthesis of a DNF Formula from a Sample of Strings
7th Brazilian Conference on Intelligent Systems (BRACIS 2018)
IEEE
to appear
James Rogers
Jeffrey Heinz
Margaret Fero
Jeremy Hurst
Dakotah Lambert
Sean Wibel
2013
Cognitive and sub-regular complexity
Formal grammar
Springer
90–108
10.1007/978-3-642-39998-5_6
Kristina Strother-Garcia
Jerey Heinz
Hyun Jin Hwangbo
2017
Using model theory for grammatical inference: a case study from phonology
International Conference on Grammatical Inference
66–78
Wolfgang Thomas
1982
Classifying regular events in symbolic logic
Journal of Computer and System Sciences
25
3
360–376
10.1016/0022-0000(82)90016-2
Wojciech Wieczorek
Olgierd Unold
2014
Induction of directed acyclic word graph in a bioinformatics task
International Conference on Grammatical Inference
207–217
Marc Zeitoun
Lorijn van Rooijen
Thomas Place
2014
On Separation by Locally Testable and Locally Threshold Testable Languages
Logical Methods in Computer Science
10
10.2168/LMCS-10(3:24)2014