[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Call for papers

Learning and Automata (LearnAut) -- ICALP 2024 workshop

July 7th - Tallinn, Estonia

Website: 
https://urldefense.com/v3/__https://learnaut24.github.io/__;!!IBzWLUs!QMOlBUPJliDMfbreyirSwuc9bguz2Adh_9clVCOhF1Z4JhAiCnAZ2kjfnWogM5IjytuRENpJyB_dqMr24XI_rgheWUc4HD4gU3zM2A7VOaGo$
 

Deadline: April 18

Submission portal: 
https://urldefense.com/v3/__https://easychair.org/conferences/?conf=learnaut2024__;!!IBzWLUs!QMOlBUPJliDMfbreyirSwuc9bguz2Adh_9clVCOhF1Z4JhAiCnAZ2kjfnWogM5IjytuRENpJyB_dqMr24XI_rgheWUc4HD4gU3zM2Hko-t-v$
 



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 aim 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.


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 include (but are not limited to):

- 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.


** Program Committee **


Dana Angluin (Yale University, United States)

Johanna Björklund (Umeå University, Sweden)

Benedikt Bollig (LSV, ENS Cachan, CNRS, France)

Tiago Ferreira (University College London, United Kingdom)

Colin de la Higuera (Université de Nantes, France)

Falk Howar (TU Dortmund, Germany)

Andrea Pferscher (University of Oslo, Norway)

Guillaume Rabusseau (McGill University)

Jurriaan Rot (Radboud University Nijmegen, the Netherlands)

Ariadna Quattoni (Universitat Politècnica de Catalunya, Spain)

Sergio Yovine (Universidad ORT, Uruguay)



** Invited Speakers **


Bernhard Aichernig (TU Graz)

(More to come)



** Submission instructions **


Submissions in the form of anonymized extended abstracts must be at most 8 
single-column pages long (plus at most four for bibliography and possible 
appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file 
is available here: 
https://urldefense.com/v3/__https://ctan.org/tex-archive/macros/latex/contrib/jmlr__;!!IBzWLUs!QMOlBUPJliDMfbreyirSwuc9bguz2Adh_9clVCOhF1Z4JhAiCnAZ2kjfnWogM5IjytuRENpJyB_dqMr24XI_rgheWUc4HD4gU3zM2LrWx9tf$
 


We do accept submissions of work recently published, currently under review or 
work-in-progress.


 - Submission url: 
https://urldefense.com/v3/__https://easychair.org/conferences/?conf=learnaut2024__;!!IBzWLUs!QMOlBUPJliDMfbreyirSwuc9bguz2Adh_9clVCOhF1Z4JhAiCnAZ2kjfnWogM5IjytuRENpJyB_dqMr24XI_rgheWUc4HD4gU3zM2Hko-t-v$
 

 - Submission deadline: April 18

 - Notification of acceptance: May 13

 - Early registration: May 17 (ICALP)

 - Workshop: July 7



** Organizers **


Sophie Fortz (King's College London, UK)

Franz Mayr (Universidad ORT Uruguay, UY)

Joshua Moerman (Open Universiteit, Heerlen, NL)

Matteo Sammartino (Royal Holloway, University of London, UK)


This email, its contents and any attachments are intended solely for the 
addressee and may contain confidential information. In certain circumstances, 
it may also be subject to legal privilege. Any unauthorised use, disclosure, or 
copying is not permitted. If you have received this email in error, please 
notify us and immediately and permanently delete it. Any views or opinions 
expressed in personal emails are solely those of the author and do not 
necessarily represent those of Royal Holloway, University of London. It is your 
responsibility to ensure that this email and any attachments are virus free.

Reply via email to