posted by user: sadegh_rk || 946 views || tracked by 1 users: [display]

LearnAut 2022 : Learning & Automata 2022


When Jul 4, 2022 - Jul 4, 2022
Where Paris, France
Submission Deadline Apr 7, 2022
Notification Due May 5, 2022
Final Version Due Jun 5, 2022
Categories    machine learning   formal methods   complexity   programming languages

Call For Papers

Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science. Historically, there has been little interaction between the GI and ICALP communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms.

The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods.

We invite submissions of recent work, including preliminary research, related to the theme of the workshop. The Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop (in person, or virtually).

Note that accepted papers will be made available on the workshop website but will not be part of formal proceedings (i.e., LearnAut is a non-archival workshop).


Topics of interest

Computational complexity of learning problems involving automata and formal languages.
Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars.
Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models.
Logical and relational aspects of learning and grammatical inference.
Theoretical studies of learnable classes of languages/representations.
Relations between automata or any other models from language theory and deep learning models for sequential data.
Active learning of finite state machines and formal languages.
Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models.
Applications of learning to formal verification and (statistical) model checking.
Metrics and other error measures between automata or formal languages.

Related Resources

IEEE ISCMI 2023   IEEE--2023 10th International Conference on Soft Computing & Machine Intelligence (ISCMI 2023)--SCIE
IEEE COINS 2023   IEEE COINS 2023 - Berlin, Germany - July 23-25 - Hybrid (In-Person & Virtual)
JCRAI 2023-Ei Compendex & Scopus 2023   2023 International Joint Conference on Robotics and Artificial Intelligence (JCRAI 2023)
EAI DLI 2023   8th EAI International Conference on Design, Learning & Innovation
ICDM 2023   International Conference on Data Mining
MIIP 2023   Medical Imaging & Image Processing III
JCICE 2023   2023 International Joint Conference on Information and Communication Engineering(JCICE 2023)
WSPML 2023   2023 4th International Workshop on Signal Processing and Machine Learning (WSPML 2023)
AIM@EPIA 2023   Artificial Intelligence in Medicine
TNNLS-GL 2023   IEEE Transactions on Neural Networks and Learning Systems Special Issue on Graph Learning