Page d'accueil

icgi

9th International Colloquium
on Grammatical Inference
St Malo, Britanny, France.

photo by galeopics

September 22(Monday) -
24(Wednesday), 2008

FINAL PROGRAMME

The proceedings of ICGI-2008 are published by Springer-Verlag as volume 5278 in their Lecture Notes in Articifial Intelligence, a subseries of the Lecture Notes in Computer Science series. LNAI 5278 is now available online. You can find information about it at http://www.springeronline.com/978-3-540-88008-0 or access the online version at http://www.springerlink.com/content/978-3-540-88008-0/

Presentations have been video-recorded and can be viewed on the VIDEOLECTURES.net website at http://videolectures.net/icgi08_saint_malo/

Invited Speakers :

François YVON (LIMSI, Paris - France)
Grammatical Inference: news from the Machine Translation front

Yasubumi SAKAKIBARA (Keio University,Department of Biosciences and Informatics, Japan)
Bio-molecular computing of finite-state automata

Final programme

Monday September 22, 2008

08:30 - 09:00	Registration of participants
09:00 - 10:30 Session 1	Learning languages from bounded resources: the case of the DFA and the balls of strings Collin de la Higuera, Jean-Christophe Janodet and Frédéric Tantini On learning regular expressions and patterns via membership and correction queries Efim Kinber A note on the relationship between different types of correction queries Cristina Tirnauca
10:30 - 11:00	Coffee break
11:00 - 12:00 Session 2	Polynomial time probabilistic learning of a subclasss of linear languages with queries Yasuhiro Tajima and Yoshiyuki Kotani Learning context sensitive languages from linear structural information Jose M. Sempere
12:00 - 14:00	Lunch
14:00 - 15:30 Session 3	Invited talk: Grammatical Inference: news from the Machine Translation front François YVON Learning meaning before syntax Dana Angluin and Leonor Becerra-Bonache
15:30 - 16:30	Posters session
16:30 - 18:00 Session 4	Identification in the limit of $k,I$-substitutable context-free languages Ryo Yoshinaka A polynomial algorithm for the inference of context free languages Alexander Clark, Rémi Eyraud and Amaury Habrard How to split recursive automata Isabelle Tellier
18:00	"Apéritif"

Tuesday September 23, 2008

08:30 - 10:00 Session 5	Learning commutative regular languages Antonio Cano Gomez and Gloria Inés Alvarez State-merging DFA induction algorithms with mandatory merge constraints Bernard Lambeau, Christophe Damas and Pierre Dupont Evaluation and Comparison of inferred regular grammars Neil Walkinshaw, Kirill Bogdanov and Ken Johnson
10:00 - 10:30	Coffee break
10:30 - 12:00 Session 6	Towards feasible PAC-learning probabilistic deterministic finite automata Jorge Castro Rabal and Ricard Gavalda Relevant reprsentations for the inference of rational stochastic tree languages François Denis, Edouard Gilbert, Amaury Habrard, Faissal Ouardi and Marc Tommasi Unsupervised learning of probabilistic context-free grammar using iterative biclustering Kewei tu and Vasant Honavar
12:00 - 13:45	Lunch
13:45 - 14:45 Session 7	Invited talk: Bio-molecular computing of finite-state automata Yasubumi SAKAKIBARA
15:00	Social event Start to Le Mont Saint Michel (by bus) Guided visit of the Abbey ans "Gala" dinner at Mère Poulard's restaurant

Wednesday September 24, 2008

09:00 - 10:30 Session 8	Learning right-to-left and left-to right iterative languages Jeffrey Heinz Learning bounded unions of Noetherian closed set systems via characteristic sets Yuuichi Kameda, Hiroo Tokunaga and Akihiro Yamamoto A learning algorithm for multi-dimensional trees, or:learning beyond context-freeness Anna Kasprzik
10:30 - 11:00	Coffee break
11:00 - 12:00 Session 9	Business Meeting
12:00 - 14:00	Lunch
14:00 - 15:30 Session 10	Polynomial distinguishability of timed automata Sicco Verwer, Mathijs de Weerdt and Cees Witteveen Schema-guided induction of monadic queries Jérôme Champavère, Rémi Guilleron, Aurélien Lemay and Joachim Niehren Using Multiplicity automata to identify transducer Relations from membership and equivalence queries Jose Oncina
16:00	End of the conference

16:40 Direct train to Paris (arrival 20:00)

Selected Full Papers:
(ordered by submission number)

Title

Authors

On Learning Regular Expressions and Patterns via Membership and Correction Queries

Efim Kinber

A Polynomial Algorithm for the Inference of Context Free Languages

Alexander Clark, Rémi Eyraud and Amaury Habrard

A Note on the Relationship between Different Types of Correction Queries

Cristina Tirnauca

Learning bounded unions of Noetherian closed set systems via characteristic sets

Yuuichi Kameda, Hiroo Tokunaga and Akihiro Yamamoto

Learning Commutative Regular Languages

Antonio Cano Gomez and Gloria Inés Alvarez

A learning algorithm for multi-dimensional trees, or: Learning beyond context-freeness

Anna Kasprzik

Learning Languages from Bounded Resources: the Case of the DFA and the Balls of Strings

Colin de la Higuera, Jean-Christophe Janodet and Frédéric Tantini

Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering

Kewei Tu and Vasant Honavar

Identification in the Limit of $k,l$-Substitutable Context-Free Languages

Ryo YOSHINAKA

State-merging DFA Induction Algorithms with Mandatory Merge Constraints

Bernard LAMBEAU, Christophe Damas and Pierre Dupont

Using Multiplicity Automata to identify Transducer Relations from Membership and Equivalence Queries

Jose Oncina

How to Split Recursive Automata

Isabelle Tellier

Schema-Guided Induction of Monadic Queries

Jérôme Champavère, Rémi Gilleron, Aurélien Lemay and Joachim Niehren

Learning context sensitive languages from linear structural information

Jose M. Sempere

Learning Meaning Before Syntax

Dana Angluin and Leonor Becerra-Bonache

Polynomial distinguishability of timed automata

Sicco Verwer, Mathijs de Weerdt and Cees Witteveen

Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata

Jorge Castro Rabal and Ricard Gavalda

Learning right-to-left and left-to-right iterative languages

Jeffrey Heinz

Polynomial time probabilistic learning of a subclass of linear languages with queries

Yasuhiro TAJIMA and Yoshiyuki Kotani

Relevant Representations for the Inference of Rational Stochastic Tree Languages

François Denis, Edouard Gilbert, Amaury Habrard, Faissal Ouardi and Marc Tommasi

Evaluation and Comparison of Inferred Regular Grammars

Neil Walkinshaw, Kirill Bogdanov and Ken Johnson

Selected Posters:

Title

Authors

Learning subclasses of pure pattern languages

P J Abisha, Thomas D G and Sindhu J Kumaar

Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems

Menno van Zaanen and Jeroen Geertzen

Learning of Regular omega-Tree Languages

Jayasri Rani M., Thomas D G and Humrosia Begam M

Inference of Uniquely Terminating EML

Kannamma S, Thomas D G and Rangarajan rangarajan

Inducing Regular Languages using Grammar-based Classifier System

Olgierd Unold

Estimating Graph Parameters using Graph Grammars

Sourav Mukherjee and Tim Oates

Which Came First, the Grammar or the Lexicon?

Tom Armstrong and Tim Oates

Identification of Node Label Controlled Graph Grammars

Christophe Costa Florencio

INSTRUCTIONS FOR SPEAKERS

- Information for ICGI'08 presentations:

Each accepted paper is allocated a 30 minutes slot (about 20 minutes for the presentation and 10 minutes for the questions and comments).
In the conference room there will be a computer - connected to a data projector - with the following configuration:
+ Windows XP SP2
+ PowerPoint 2002
+ Acrobat 7
Please make sure that your presentation works flawlessly with the specified software.
Each presentation in an electronic form should be handed over to the organizers or the chair before the session.
For this, a USB Flash disk will be available (CD or DVD medium should be fine also).
In case you need your own computer for your presentation, please contact the organizers.

- Information for ICGI'08 posters:

The posters will be visible during all the conference. Their presentation is planned on Monday from 15:30 to 16:30.
Posters will have an allocated space of 90cm wide by 120cm high (i.e. about 35 inches by 47 inches).
Your poster, in portrait format, must not exceed these dimensions.

With the help of the Pascal2 Network of Excellence (http://www.pascal-network.org/), we propose to record the ICGI'08 presentations and to publish them with the other events organized or sponsored by Pascal2 on Videolectures (http://videolectures.net/pascal/)... Please, warn us if you don't want your presentation to be video-recorded.

Do not hesitate to contact us if you need further information.
Looking forward to meeting you in St Malo,
The ICGI'08 organizing committee.
icgi08@irisa.fr