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.
| << January 2006 | ||||||
|---|---|---|---|---|---|---|
| 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
|
||||
16-21 July 2006, 14th International Conference on Conceptual Structures: Conceptual Structures - Inspiration and Application, Aalborg University, Denmark
The International Conferences on Conceptual Structures (ICCS) has been held annually in Europe, Australia, or North America since 1993. The central focus is the formal representation and analysis of conceptual knowledge with research and business applications focusing on artificial intelligence, computational linguistics, and related areas of computer science.
For more information, see http://www.iccs-06.hum.aau.dk/
12 January 2006, Workshop on The Logic of Variation, Drift 23, room 010 and Drift 15, room 002
On Friday 13th of January, Willemijn Vermaat defends her PhD thesis 'The Logic of Variation' at Utrecht University (Academiegebouw, Domplein 29, Utrecht, 12.45). On the occasion of this event, an informal workshop will be held on Thursday 12th of January.
For more information, see here or contact Merlijn Sevenster at sevenstr at science.uva.nl.
8 May 2006, 4th International Workshop on Declarative Agent Languages and Technologies (DALT-2006), Future University Hakodate, Japan
DALT-2006 will be held as a satellite workshop of AAMAS-2006, the 5th International Joint Conference on Autonomous Agents and Multiagent Systems. Topics of interest include logic-based approaches to specifying and developing multiagent systems (including modal and temporal logics, model checking, constraint logic programming) and applications such as the semantic web, security, and electronic contracting. Deadline for submission of papers is the 15 January 2006.
For more information, see http://staff.science.uva.nl/~ulle/DALT-2006/ or contact Ulle Endriss (ulle at illc.uva.nl).
4-5 March 2006, Seventh Annual Princeton-Rutgers Graduate Conference, Dept. of Philosophy, Princeton University, USA
The philosophy graduate student associations of Rutgers University and Princeton University will be hosting a conference on the weekend of March 4-5, 2006. Papers from graduate students in all areas of philosophy will be considered. Deadline: January 15th 2006.
For more information, see here or http://web.princeton.edu/sites/philosph/gradconf/
3-4 May 2006, 3rd International Workshop on Philosophy and Informatics (WSPI 2006), Saarbr¨cken, Germany
The Third International Workshop on Philosophy and Informatics is organized by the Institute for Formal Ontology and Medical Information Science and the Special Interest Group on Philosophy and Informatics of the German Informatics Society.
The workshops are designed to encourage interdisciplinary exchange on the philosophical foundations of informatics. They seek to bring together researchers from philosophy and informatics and neighboring disciplines in order to explore common points of interest and to develop an interface between the disciplines and a common vocabulary. The workshop also serves as the annual meeting platform of the members of the Special Interest Group on Philosophy and Informatics. The 2006 Workshop has a special focus on the area of bio- and biomedical informatics.
For more information, see http://wspi2006.workshop.hm/
WSPI 2006 focuses on bioinformatics, but contributions on philosophy and informatics in general are also invited. Submission deadline is 16 January 2006.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
19-21 January 2006, Days in Logic - 2006, Coimbra, Portugal
This meeting aims at bringing together mathematicians and computer scientists with interests in Logic. It is specially directed for graduate students. It consists of four introductory courses and contributed talks. Courses include "Category Theory", "Proof Interpretations", "Computations with Ordinals, and Models of Set Theory" and "Provable Recursion and Arithmetical Independence Results"
For registration or more information, see http://www.mat.uc.pt/~kahle/dl06/ or contact the organizers at kahle at mat.uc.pt.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
19-21 January 2006, Days in Logic - 2006, Coimbra, Portugal
This meeting aims at bringing together mathematicians and computer scientists with interests in Logic. It is specially directed for graduate students. It consists of four introductory courses and contributed talks. Courses include "Category Theory", "Proof Interpretations", "Computations with Ordinals, and Models of Set Theory" and "Provable Recursion and Arithmetical Independence Results"
For registration or more information, see http://www.mat.uc.pt/~kahle/dl06/ or contact the organizers at kahle at mat.uc.pt.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
19-21 January 2006, Days in Logic - 2006, Coimbra, Portugal
This meeting aims at bringing together mathematicians and computer scientists with interests in Logic. It is specially directed for graduate students. It consists of four introductory courses and contributed talks. Courses include "Category Theory", "Proof Interpretations", "Computations with Ordinals, and Models of Set Theory" and "Provable Recursion and Arithmetical Independence Results"
For registration or more information, see http://www.mat.uc.pt/~kahle/dl06/ or contact the organizers at kahle at mat.uc.pt.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
27-30 June 2006, Sixth International Andrei Ershov Memorial Conference: PERSPECTIVES OF SYSTEM INFORMATICS, Novosibirsk, Akademgorodok, Russia
The conference is held to honor the 75th anniversary of academician Andrei Ershov (1931-1988) and his outstanding contributions towards advancing informatics. The first five conferences were held in 1991, 1996, 1999, 2001 and 2003, respectively, and proved to be significant international events.
The aim of the conference is to provide a forum for the presentation and in-depth discussion of advanced research directions in computer science. For a developing science, it is important to work out consolidating ideas, concepts and models. Movement in this direction is another aim of the conference. Improvement of the contacts and exchange of ideas between researchers from the East and West are further goals.
For more information, see here or http://www.iis.nsk.su/PSI06/
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
23-27 January 2006, OzsL Schoolweek, , Hotel Zwartewater, Zwartsluis
Far too few people subscribed for the schoolweek of the OzsL. Therefore the organisers decided to cancel the schoolweek.
For more information, see here or the OZSL-site at http://www.ozsl.uu.nl/.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
23-27 January 2006, OzsL Schoolweek, , Hotel Zwartewater, Zwartsluis
Far too few people subscribed for the schoolweek of the OzsL. Therefore the organisers decided to cancel the schoolweek.
For more information, see here or the OZSL-site at http://www.ozsl.uu.nl/.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
23-27 January 2006, OzsL Schoolweek, , Hotel Zwartewater, Zwartsluis
Far too few people subscribed for the schoolweek of the OzsL. Therefore the organisers decided to cancel the schoolweek.
For more information, see here or the OZSL-site at http://www.ozsl.uu.nl/.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
23-27 January 2006, OzsL Schoolweek, , Hotel Zwartewater, Zwartsluis
Far too few people subscribed for the schoolweek of the OzsL. Therefore the organisers decided to cancel the schoolweek.
For more information, see here or the OZSL-site at http://www.ozsl.uu.nl/.
12-14 July 2006, Eighth International Workshop on Deontic Logic in Computer Science (DEON2006), Utrecht
The biennial DEON workshops are designed to promote cooperation among scholars across disciplines who are interested in deontic logic and its use in computer science. These workshops traditionally support research linking the formal-logical study of normative concepts and normative systems with computer science, artificial intelligence, philosophy, organisation theory and law. In addition to these general themes, DEON2006 will encourage a special focus on the topic "Artificial Normative Systems"
For more information see http://www.cs.uu.nl/deon2006/
The deadline for submission of original, previously unpublished, research papers is January 27, 2006.
22-24 June 2006, the International European Conference on Computing and Philosophy (ECAP) 2006, Trondheim, Norway
E-CAP is the European conference on Computing and Philosophy, the European affiliate of the International Association for Computing and Philosophy (IACAP) The E-CAP conferences deal with all aspects of the "computational turn" that is occurring through the interaction between the disciplines of Philosophy and Computing.
For more information, see http://www.eu-cap.org/
The Programme Committee cordially invites all researchers to submit their papers for presentation. Submission deadline is Jaunary 27, 2006.
12-14 July 2006, DEON 2006: Eighth International Workshop on Deontic Logic in Computer Science, Utrecht, The Netherlands
The biennial DEON workshops are designed to promote cooperation among scholars across disciplines who are interested in deontic logic and its use in computer science. These workshops traditionally support research linking the formal-logical study of normative concepts and normative systems with computer science, artificial intelligence, philosophy, organisation theory and law. In addition to these general themes, DEON2006 will encourage a special focus on the topic "Artificial Normative Systems"
For more information, see http://www.cs.uu.nl/deon2006/
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
23-27 January 2006, OzsL Schoolweek, , Hotel Zwartewater, Zwartsluis
Far too few people subscribed for the schoolweek of the OzsL. Therefore the organisers decided to cancel the schoolweek.
For more information, see here or the OZSL-site at http://www.ozsl.uu.nl/.
27 January 2006, Topics in Ancient & Medieval Logic, P1.14, Euclides Building, Plantage Muidergracht 24, Amsterdam
Students who participated in the ancient & medieval logic project will be presenting their results on the topics of Stoice logic, future contingents & the immutability of God, linguistic analyses of the use of pronouns in the Eucharist, and Anselm's logic of agency. Everyone is welcome!
For more information, see http://staff.science.uva.nl/~suckelma/medlogic.html or contact Sara Uckelman (suckelma at illc.uva.nl)
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/
31 March - 2 April 2006, BOISE EXTRAVAGANZA IN SET THEORY, Boise, Idaho, USA
We are pleased to announce our fifteenth annual BEST conference. There
will be four talks by invited speakers:
Natasha Dobrinen (Kurt Godel Research Center for Mathematical Logic)
Michael Hrusak (UNAM)
Istvan Juhasz (Alfred Renyi Institute of Mathematics)
Boban Velickovic (Universite de Paris 7)
For more information, see http://math.boisestate.edu/~best/best15/.
The Programme Committee cordially invites all researchers to submit their papers for presentation.
16 January - 7 July 2006, Logic and Algorithms
Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.
Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.
For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/