These pages provide information about recent developments at or relevant to the ILLC. Please let us know if you have material that you would like to be added to the news pages, by using the online submission form. For minor updates to existing entries you can also email the news administrators directly. English submissions strongly preferred.
The calender view is not available on the mobile version of the website. You can view this information as a list.
You can also view this information as a list or iCalendar-feed, or import the embedded hCalendar metadata into your calendar-app.
| << December 2002 | ||||||
|---|---|---|---|---|---|---|
| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
|
1
|
2
|
3
|
4
|
5
|
6
|
7
|
|
8
|
9
|
10
|
11
|
12
|
13
|
14
|
|
15
|
16
|
17
|
18
|
19
|
20
|
21
|
|
22
|
23
|
24
|
25
|
26
|
27
|
28
|
|
29
|
30
|
31
|
||||
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
2 December 2002, Finite model property for guarded fragments, Ian Hodkinson
Abstract:
Guarded fragments are in some sense `modal-style'
fragments of first-order logic. Introduced by
Andréka, van Benthem and Németi in 1997,
they have become very popular. They share nice properties
with modal logic, such as decidability with reasonable
complexity. The finite model property for the basic
guarded fragment was established by Erich Grädel in
1999. Since then, several more results for stronger
fragments have been proved. The proofs use a
combinatorial theorem of Herwig, and recently this theorem
has been strengthened in joint work with Martin Otto,
permitting a simpler proof that the loosely guarded and
packed (or clique-guarded) fragments have the finite model
property. I will outline some of the ideas and history of
this area of research.
For more information, contact Yde Venema (yde at science.uva.nl)
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
4 December 2002, Benelearn 2002: the
Twelfth Annual Dutch-Belgian Conference on Machine Learning, Utrecht, the Netherlands
Benelearn is the annual machine learning conference of Belgium and The Netherlands. It serves as a forum for researchers in this field to exchange ideas and present recent work.
For more information, see http://www.cs.uu.nl/~marco/benelearn2002/
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
6 December 2002, Colloquium on Mathematical Logic, Claire Kouwenhoven, Jaap van Oosten
Saxena
(Bus 12 from Utrecht Central Station).
For abstracts and more information, see http://www.math.uu.nl/people/jvoosten/seminar.html
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
10 December 2002, Zuidelijk Interuniversitair Colloquium (ZIC), Sandro Etalle (Twente University)
protocols.
For abstracts and more information, see http://www.win.tue.nl/zic/ or contact Francien Dechesne (f.dechesne at uvt.nl).
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
11 December 2002, Logic Tea, Ron Rood, Vrije Universiteit
Amsterdam
The abstract of this talk can be found here or on The Logic Tea homepage at http://staff.science.uva.nl/~debruin/logic_tea.html For further information please contact Mark Theunissen at mailto:mtheunis at science.uva.nl, or Boudewijn de Bruin at mailto:debruin at science.uva.nl.
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
12 December 2002, DIP Colloquium, Katja Jasinskaja
For abstracts and more information, see https://www.illc.uva.nl/dip/.
2-13 December 2002, Logic and Automated Reasoning Summer School
University, Canberra, Australia
The Logic and Automated Reasoning Summer School comprises a blend of practical and theoretical short courses on aspects of pure and applied logic taught by international and Australian experts. The school provides a unique learning experience for all participants, backed up with state-of-the-art computational science facilities at the ANU.
For more information, see here or the website at http://arp.anu.edu.au/lss, or contact the Convenor, Dr John Slaney, at lss-admin at arp.anu.edu.au.
13 December 2002, Computing with LLI Seminar, Ian Hodkinson
(IC London)
For abstracts and more information, see http://lit.science.uva.nl/News/seminar02-2.html#Dec13.
13 December 2002, Colloquium on Mathematical Logic, Albert Visser
(Bus 12 from Utrecht Central Station).
For abstracts and more information, see http://www.math.uu.nl/people/jvoosten/seminar.html
16-17 December 2002, Logic in Games and Multiagent Systems
The symposium aims at bringing together researchers working at the intersection of logic, game theory and multiagent systems, in order to identify the key issues, problems, and techniques in the application of logic to games and multiagent systems. Conferences with a related subject area are LOFT, TARK, and LGS.
For more information, see http://www.csc.liv.ac.uk/~pauly/logamas/
16-17 December 2002, Logic in Games and Multiagent Systems
The symposium aims at bringing together researchers working at the intersection of logic, game theory and multiagent systems, in order to identify the key issues, problems, and techniques in the application of logic to games and multiagent systems. Conferences with a related subject area are LOFT, TARK, and LGS.
For more information, see http://www.csc.liv.ac.uk/~pauly/logamas/
18 December 2002, Music & AI Colloquium, Taylan Cemgil
Automatic music transcription refers to extraction of a human readable and interpretable description from a recording of a musical performance. Traditional music notation is such a description that lists the pitch levels (notes) and corresponding timestamps. Such a representation would be useful in several applications such as interactive music performance, information retrieval (Music-IR) and content description of musical material in large music databases. In this talk, I will focus on a subproblem in music-ir, where I assume that exact timing information of notes is available, for example as a stream of MIDI events from a digital keyboard. I will present a probabilistic generative model for timing deviations in expressive music performance. The structure of the proposed model will turn out to be a switching state space model (switching Kalman filter). The switch variables correspond to discrete note locations as in a musical score. The continuous hidden variables denote the tempo.
Given the model, we can formulate two well known music recognition problems, namely tempo tracking and automatic transcription (rhythm quantization) as filtering and maximum a posteriori (MAP) state estimation tasks. Unfortunately, exact computation of posterior features such as the MAP state is intractable in this model class, so we resort to Monte Carlo methods for integration and optimization. I have compared Markov Chain Monte Carlo (MCMC) methods (such as Gibbs sampling, simulated annealing and iterative improvement) and sequential Monte Carlo methods (particle filters). Simulation results suggest better results with sequential methods. The methods can be applied in both online and batch scenarios (such as tempo tracking and transcription) and are thus potentially useful in a number of music applications such as adaptive automatic accompaniment, score typesetting and music information retrieval.