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.
| << March 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
|
|
18-21 July 2006,
13th Workshop on Logic, Language, Information and Computation
(WoLLIC'2006)
, Stanford, California, USA
This is the thirteenth in a series of workshops to foster interdisciplinary research in pure and applied logic.
For more information, see http://www.cin.ufpe.br/~wollic/wollic2006/
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 February - 3 March 2006, Logic and Databases, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
Logic and databases have been intimately linked since the rise of relational database systems in the 1970s. Relational databases can be modelled by finite relational structures, and first-order logic lies at the core of standard database query languages such as the Structured Query Language, SQL. As another example, closer to current research, XML documents can be modelled by labelled unranked trees, and XML query languages as logics on trees.
The workshop will focus on recent research on logical aspects of the theory of database systems. These include the applications of logic and logical methods in the study of databases as well as questions in logic that arise from this study. Particular topics of interest include the expressive power and complexity of query languages; models and languages for semi-structured data; probabilistic databases; constraint databases, etc.
For more information, see http://www.newton.cam.ac.uk/programmes/LAA/laaw02.html
2-5 June 2006, KR2006 DOCTORAL CONSORTIUM, Lake District, UK
The 10th International Conference on Principles of Knowledge Representation and Reasoning (KR2006) invites PhD students to apply for the Doctoral Consortium program. It is a student mentoring program that will introduce students to senior researchers with similar interests.
Information about how to submit the applications can be found on the following web pages: http://www.cs.ust.hk/~flin/kr06-dc.html For more information, see here.
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 February - 3 March 2006, Logic and Databases, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
Logic and databases have been intimately linked since the rise of relational database systems in the 1970s. Relational databases can be modelled by finite relational structures, and first-order logic lies at the core of standard database query languages such as the Structured Query Language, SQL. As another example, closer to current research, XML documents can be modelled by labelled unranked trees, and XML query languages as logics on trees.
The workshop will focus on recent research on logical aspects of the theory of database systems. These include the applications of logic and logical methods in the study of databases as well as questions in logic that arise from this study. Particular topics of interest include the expressive power and complexity of query languages; models and languages for semi-structured data; probabilistic databases; constraint databases, etc.
For more information, see http://www.newton.cam.ac.uk/programmes/LAA/laaw02.html
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 February - 3 March 2006, Logic and Databases, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
Logic and databases have been intimately linked since the rise of relational database systems in the 1970s. Relational databases can be modelled by finite relational structures, and first-order logic lies at the core of standard database query languages such as the Structured Query Language, SQL. As another example, closer to current research, XML documents can be modelled by labelled unranked trees, and XML query languages as logics on trees.
The workshop will focus on recent research on logical aspects of the theory of database systems. These include the applications of logic and logical methods in the study of databases as well as questions in logic that arise from this study. Particular topics of interest include the expressive power and complexity of query languages; models and languages for semi-structured data; probabilistic databases; constraint databases, etc.
For more information, see http://www.newton.cam.ac.uk/programmes/LAA/laaw02.html
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/
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/
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/
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/
5-10 March 2006, 11th Estonian Winter School in Computer Science (EWSCS'06), Palmse, Estonia
EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics (IoC), a research institute of Tallinn University of Technology. EWSCS'06 is the eleventh event of the series.
The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English.
Deadline for registration: 20 January 2006
For more information, an online registration form and a course list, see http://www.cs.ioc.ee/yik/schools/win2006/
29 August - 2 September 2006, RELATIONS AND KLEENE ALGEBRA IN COMPUTER SCIENCE, Manchester, UK
The RelMiCS Conference is the main forum for the relational calculus as a conceptual and methodological tool. The AKA Workshop is a forum on topics related to Kleene algebras. As in previous years, the two events are co-organised; they have a joint programme committee and joint proceedings. RelMiCS/AKA 2006 will be held from 30 August to 2 September 2006 and a PhD training programme on 29 August 2006.
For more information, see http://www.cs.man.ac.uk/relmics06/
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/
5-10 March 2006, 11th Estonian Winter School in Computer Science (EWSCS'06), Palmse, Estonia
EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics (IoC), a research institute of Tallinn University of Technology. EWSCS'06 is the eleventh event of the series.
The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English.
Deadline for registration: 20 January 2006
For more information, an online registration form and a course list, see http://www.cs.ioc.ee/yik/schools/win2006/
6 March 2006, Curious Minds: scientific reasoning in early youth, KNAW-gebouw, Kloveniersburgwal 29, Amsterdam
The goal of this symposium is to give an overview of current research into the reasoning abilities of preschool children, both in the Netherlands and outside. Which talents, potentials and abilities do children aged 3-5 have, how are talents in different fields interconnected, and how can these talents be developed further? The main focus will be on talents that could be considered part of the fields of mathematics, physics, technique and logic.
For more information, including a preliminary program, see http://www.talentenkracht.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/
5-10 March 2006, 11th Estonian Winter School in Computer Science (EWSCS'06), Palmse, Estonia
EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics (IoC), a research institute of Tallinn University of Technology. EWSCS'06 is the eleventh event of the series.
The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English.
Deadline for registration: 20 January 2006
For more information, an online registration form and a course list, see http://www.cs.ioc.ee/yik/schools/win2006/
7-11 August 2006, ESSLLI Summer School, Malaga, Spain
The workshop on rationality and knowledge intends to bring together researchers from a wide variety of fields - including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Logic, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge.
Invited speakers are Johan van Benthem (Amsterdam/Stanford) and Remzi Sanver (Istanbul Bilgi University).
The workshop is part of ESSLLI 2006 and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consecutive days in the second week of ESSLLI. There will be 2 or 3 slots for paper presentation and discussion per session.
For more information, see: http://www.cs.gc.cuny.edu/~sartemov/rkw/.
FOCA (Formal Ontologies for Communicating Agents) at ESSLLI 2006, Malaga, Spain
The purpose of the workshop is to gather contributions that (i) take seriously into account the ontological aspects of communication and interaction and (ii) use formal ontologies for achieving a better semantic coordination between interacting and communicating agents.
For more information, see here or http://www.loa-cnr.it/esslli06/
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/
5-10 March 2006, 11th Estonian Winter School in Computer Science (EWSCS'06), Palmse, Estonia
EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics (IoC), a research institute of Tallinn University of Technology. EWSCS'06 is the eleventh event of the series.
The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English.
Deadline for registration: 20 January 2006
For more information, an online registration form and a course list, see http://www.cs.ioc.ee/yik/schools/win2006/
8 - 10 March 2006, Workshop on Constructive Set Theory, Room G103, Nieuwe Prinsengracht 130, Amsterdam / Room K11, Budapestlaan 6, Utrecht
An informal workshop on constructive set theory (Aczel's CZF in particular), with speakers including Peter Aczel, Michael Rathjen and Robert Lubarsky.
For more information, see http://www.math.uu.nl/people/vdberg/workshop/
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/
5-10 March 2006, 11th Estonian Winter School in Computer Science (EWSCS'06), Palmse, Estonia
EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics (IoC), a research institute of Tallinn University of Technology. EWSCS'06 is the eleventh event of the series.
The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English.
Deadline for registration: 20 January 2006
For more information, an online registration form and a course list, see http://www.cs.ioc.ee/yik/schools/win2006/
8 - 10 March 2006, Workshop on Constructive Set Theory, Room G103, Nieuwe Prinsengracht 130, Amsterdam / Room K11, Budapestlaan 6, Utrecht
An informal workshop on constructive set theory (Aczel's CZF in particular), with speakers including Peter Aczel, Michael Rathjen and Robert Lubarsky.
For more information, see http://www.math.uu.nl/people/vdberg/workshop/
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/
5-10 March 2006, 11th Estonian Winter School in Computer Science (EWSCS'06), Palmse, Estonia
EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics (IoC), a research institute of Tallinn University of Technology. EWSCS'06 is the eleventh event of the series.
The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English.
Deadline for registration: 20 January 2006
For more information, an online registration form and a course list, see http://www.cs.ioc.ee/yik/schools/win2006/
8 - 10 March 2006, Workshop on Constructive Set Theory, Room G103, Nieuwe Prinsengracht 130, Amsterdam / Room K11, Budapestlaan 6, Utrecht
An informal workshop on constructive set theory (Aczel's CZF in particular), with speakers including Peter Aczel, Michael Rathjen and Robert Lubarsky.
For more information, see http://www.math.uu.nl/people/vdberg/workshop/
10 March 2006, NVTI Theory Day 2006, Hoog Brabant, Utrecht
We are happy to invite you for the Theory Day 2006 of the NVTI. The Dutch Asssociation for Theoretical Computer Science (NVTI) supports the study of theoretical computer and its applications.
As in previous years we have a strong program featuring excellent speakers from the Netherlands and abroad, covering important streams in theoretical computer science.
For more information, see http://www.nvti.nl/Theorydays.html.
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/
11-13 March 2006, MODNET - Workshop Around o-minimality, Leeds, UK
Topics include the general theory of o-minimality, generalizations, definable groups, and connections with stability and complex geometry. Speakers will (tentatively) include: Alessandro Berarducci, Mario Edmundo, Rahim Moosa, Kobi Peterzil, Artur Piekosz, Zachary Robinson, Sergei Starchenko, Alex Wilkie, Boris Zilber.
For more information, see http://www.logique.jussieu.fr/modnet/events/omin06Leeds.html
4-8 September 2006, UC06, 5th International Conference on Unconventional Computation, York, UK
The series of International Conferences UNCONVENTIONAL COMPUTATION (UC) is devoted to all aspects of unconventional computation, theory as well as experiments and applications. Typical, but not exclusive, topics are: natural computing including quantum, cellular, molecular, neural and evolutionary computing; chaos and dynamical systems based computing; and various proposals for computations that go beyond the Turing model.
For more information, see http://www.cs.york.ac.uk/nature/uc06/
Original papers are solicited in all areas of unconventional computation. Papers dealing with theory as well as with experiments and applications are welcome. Submission deadline is 12 March 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/
11-13 March 2006, MODNET - Workshop Around o-minimality, Leeds, UK
Topics include the general theory of o-minimality, generalizations, definable groups, and connections with stability and complex geometry. Speakers will (tentatively) include: Alessandro Berarducci, Mario Edmundo, Rahim Moosa, Kobi Peterzil, Artur Piekosz, Zachary Robinson, Sergei Starchenko, Alex Wilkie, Boris Zilber.
For more information, see http://www.logique.jussieu.fr/modnet/events/omin06Leeds.html
10-12 August 2006, MKM 2006: Fifth International Conference on Mathematical Knowledge Management, South East England, UK
Mathematical Knowledge Management (MKM) is an emerging interdisciplinary field of research in the intersection of mathematics, computer science, library science, and scientific publishing. Its objective is to develop new and better ways of managing mathematical knowledge using sophisticated software tools. Its grand challenge is to create a universal digital mathematics library accessible via the World-Wide Web.
MKM 2006 will be the fifth conference in a series of international MKM conferences that started in 2001. MKM 2006 will stress two themes: the nature of mathematical proof and its role in managing mathematical knowledge. and new modes of consuming and producing mathematical knowledge.
For more information, including a registration form, see http://www.reading.ac.uk/MKM06/
MKM 2006 welcomes research papers and workshop proposals on these two themes as well as on all other aspects of MKM. Submissin deadline is March 13, 2006 (for papers) and February 27, 2006 (for workshop proposals).
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/
11-13 March 2006, MODNET - Workshop Around o-minimality, Leeds, UK
Topics include the general theory of o-minimality, generalizations, definable groups, and connections with stability and complex geometry. Speakers will (tentatively) include: Alessandro Berarducci, Mario Edmundo, Rahim Moosa, Kobi Peterzil, Artur Piekosz, Zachary Robinson, Sergei Starchenko, Alex Wilkie, Boris Zilber.
For more information, see http://www.logique.jussieu.fr/modnet/events/omin06Leeds.html
17-20 August 2006, ICLP'06: 22nd International Conference on Logic Programming, Seattle, Washington, USA
Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming.
For more information, see http://www.cs.uky.edu/iclp06/
Contributions (papers and posters) are sought in all areas of logic programming. Submission deadline for paper abstracts is February 14th, 2005: for posters it is March 14th, 2005.
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/
1-4 September 2006, Trends in Logic IV: Studia Logica International Conference, Torun, Poland
The leading idea of Lvov-Warsaw School of Logic, philosophy and mathematics was to investigate the philosophical problems by means of rigorous methods of mathematics. Since its very first issue Studia Logica has joined forces of mathematicians and philosophers in carrying out logical investigations. There are many elaborate mathematical theories that find their origin in philosophy and have had a big impact on both philosophy and mathematics. For a couple of decades we have been witnessing the fruitful application of strictly mathematical methods to handling more and more philosophical problems.
The main goal of the conference is to present current trends in applying mathematical methods to philosophical problems.
For more information, see http://www.logika.uni.torun.pl/TrendsIV.html
The Programme Committee invites the contributions concerning applications of mathematical methods to philosophical problems. Submission deadline is May 15, 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/
15 March 2006, Set Theory and Analysis, London, UK
There will be a "Set Theory and its Neighbours" meeting in London on 15th March 2006, with some funding from 'Cameleon'. The speakers at the meeting will be Peter Komjath, Matteo Viale, Mirna Dzamonja, Taras Banakh and Piotr Koszmider. As ever, we aim to keep the meetings fairly relaxed, allowing plenty of opportunity for informal discussion. We welcome and encourage anyone to participate.
For more information, see here.
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 March 2006, Amsterdam-London Workshop on Modal Logic, Room I. 401, Nieuwe Achtergracht 168-178, Amsterdam
The first Amsterdam-London Workshop on Modal Logic will take place on 16th of March, 2006 at the ILLC. The speakers include:
Ian Hodkinson (Imperial College London)
Robin Hirsch (University College London)
Roman Kontchakov (Birkbeck College London)
Mikhail Sheremet (Birkbeck College London)
Mai Gehrke (New Mexico State University)
Guram Bezhanishvili (New Mexico State University)
Johan van Benthem (University of Amsterdam)
Yde Venema (University of Amsterdam)
Balder ten Cate (University of Amsterdam)
For more information, see http://staff.science.uva.nl/~nbezhani/workshop/ or contact Nick Bezhanishvili at nbezhani at science.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/
17 March 2006, One-day workshop 'Logic and Linguistics', Room 1.04, Institute of Linguistics OTS, Drift 23, Utrecht
The goal of the workshop is to allow researchers working on formal linguistics to present their ongoing work. Speakers include Jan van Eijck, Michael Moortgat & Willemijn Vermaat, Rick Nouwen, Oystein Nilsen & Jakub Dotlacil, Matteo Capelletti, Fabian Battaglini.
For more information, contact Fabian Battaglini at Fabian.Battaglini at let.uu.nl
17 March 2006, Logic and Linguistics, Utrecht Institute of Linguistics OTS, Drift 23, room 1.04
The goal of the workshop is to allow people working on formal linguistics to present their ongoing research. This workshop is organised in collaboration with the CTL colloquium. Speakers include Jan van Eijck, Michael Moortgat, Matteo Capelletti and Fabian Battaglini.
For more information, see here
24 June - 8 July 2006, ICCL Summer School 2006: Knowledge Structures, TU Dresden, Germany
It is common wisdom that the still growing power of digital data processing greatly enhances the wealth of human knowledge and will continue to do so. A precondition for this is, however, that knowledge is encoded and represented in a computer-accessible manner, such that it can be algorithmically processed. This requires, in turn, the use of appropriate formal structures for knowledge representation and knowledge processing. Such structures, called `Knowledge Structures', will be the topic of this year's ICCL summer school.
Deadline for registration: 18 March 2006. For more information, an online registration form and a preliminary program, see http://www.computational-logic.org/iccl-ss-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/
20-24 March 2006, Mathematics of constraint satisfaction: Algebra, Logic, and Graph Theory, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
The study of constraint satisfaction problems (CSPs) began in the 1970's in artificial intelligence, where this paradigm is now as popular as ever, with hundreds of researchers using this framework to model and solve a wide variety of problems. In 1978, Thomas Schaefer published a seminal paper on the complexity classification of Boolean CSPs, and since then the importance of the CSP in theoretical computer science has continued to grow. For example, many standard complete problems for standard complexity classes are variants of CSPs, and some of the first optimal inapproximability results in combinatorial optimization were proved for certain CSPs.
For more information, see http://www.comlab.ox.ac.uk/mathscsp/.
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/
20-24 March 2006, Mathematics of constraint satisfaction: Algebra, Logic, and Graph Theory, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
The study of constraint satisfaction problems (CSPs) began in the 1970's in artificial intelligence, where this paradigm is now as popular as ever, with hundreds of researchers using this framework to model and solve a wide variety of problems. In 1978, Thomas Schaefer published a seminal paper on the complexity classification of Boolean CSPs, and since then the importance of the CSP in theoretical computer science has continued to grow. For example, many standard complete problems for standard complexity classes are variants of CSPs, and some of the first optimal inapproximability results in combinatorial optimization were proved for certain CSPs.
For more information, see http://www.comlab.ox.ac.uk/mathscsp/.
21-22 March 2006, Infinity Symposium, Room S111, Faculty of Sciences, Vrije Universiteit Amsterdam
INFINITY is a BRICKS project sponsored by NWO, and is concerned with infinite objects, computation, modeling, and reasoning. The symposium is meant as an opportunity to learn about related work and meet people working in related fields. Most talks will be of a tutorial nature.
For more information, see here or http://fspc282.few.vu.nl/infinity/index.php/Infinity_Symposium
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/
20-24 March 2006, Mathematics of constraint satisfaction: Algebra, Logic, and Graph Theory, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
The study of constraint satisfaction problems (CSPs) began in the 1970's in artificial intelligence, where this paradigm is now as popular as ever, with hundreds of researchers using this framework to model and solve a wide variety of problems. In 1978, Thomas Schaefer published a seminal paper on the complexity classification of Boolean CSPs, and since then the importance of the CSP in theoretical computer science has continued to grow. For example, many standard complete problems for standard complexity classes are variants of CSPs, and some of the first optimal inapproximability results in combinatorial optimization were proved for certain CSPs.
For more information, see http://www.comlab.ox.ac.uk/mathscsp/.
21-22 March 2006, Infinity Symposium, Room S111, Faculty of Sciences, Vrije Universiteit Amsterdam
INFINITY is a BRICKS project sponsored by NWO, and is concerned with infinite objects, computation, modeling, and reasoning. The symposium is meant as an opportunity to learn about related work and meet people working in related fields. Most talks will be of a tutorial nature.
For more information, see here or http://fspc282.few.vu.nl/infinity/index.php/Infinity_Symposium
22-24 March 2006, SALT 16 (Semantics and Linguistic Theory), Tokyo
SALT 16 will be held March 22-24, 2006 at the Komaba campus of the University of Tokyo under the auspices of the Center for Evolutionary Cognitive Sciences. SALT has provided a leading annual international forum for semantics for the past 15 years. 2006 will mark the first time for it to be held outside the United States.
For more information, see here or http://research.nii.ac.jp/salt16/
27-30 August 2006, CONCUR'06: 17th International Conference on Concurrency Theory, Bonn, Germany
CONCUR 2006, the 17th International Conference on Concurrency Theory, will take place in Bonn, Germany, August 27 - 30, 2006. The purpose of the CONCUR conferences is to bring together researchers working on the theory of concurrency and its applications. About ten workshops will be held in affiliation with CONCUR 2006, including the 2nd German Verification Day, and the 11th International ERCIM Workshop on Formal Methods for Industrial Critical Systems.
For more information, see http://depend.cs.uni-sb.de/concur06/.
Submissions are solicited in all areas of semantics, logics, and verification techniques for concurrent systems. Submission deadline is March 23, 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/
20-24 March 2006, Mathematics of constraint satisfaction: Algebra, Logic, and Graph Theory, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
The study of constraint satisfaction problems (CSPs) began in the 1970's in artificial intelligence, where this paradigm is now as popular as ever, with hundreds of researchers using this framework to model and solve a wide variety of problems. In 1978, Thomas Schaefer published a seminal paper on the complexity classification of Boolean CSPs, and since then the importance of the CSP in theoretical computer science has continued to grow. For example, many standard complete problems for standard complexity classes are variants of CSPs, and some of the first optimal inapproximability results in combinatorial optimization were proved for certain CSPs.
For more information, see http://www.comlab.ox.ac.uk/mathscsp/.
22-24 March 2006, SALT 16 (Semantics and Linguistic Theory), Tokyo
SALT 16 will be held March 22-24, 2006 at the Komaba campus of the University of Tokyo under the auspices of the Center for Evolutionary Cognitive Sciences. SALT has provided a leading annual international forum for semantics for the past 15 years. 2006 will mark the first time for it to be held outside the United States.
For more information, see here or http://research.nii.ac.jp/salt16/
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/
20-24 March 2006, Mathematics of constraint satisfaction: Algebra, Logic, and Graph Theory, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
The study of constraint satisfaction problems (CSPs) began in the 1970's in artificial intelligence, where this paradigm is now as popular as ever, with hundreds of researchers using this framework to model and solve a wide variety of problems. In 1978, Thomas Schaefer published a seminal paper on the complexity classification of Boolean CSPs, and since then the importance of the CSP in theoretical computer science has continued to grow. For example, many standard complete problems for standard complexity classes are variants of CSPs, and some of the first optimal inapproximability results in combinatorial optimization were proved for certain CSPs.
For more information, see http://www.comlab.ox.ac.uk/mathscsp/.
22-24 March 2006, SALT 16 (Semantics and Linguistic Theory), Tokyo
SALT 16 will be held March 22-24, 2006 at the Komaba campus of the University of Tokyo under the auspices of the Center for Evolutionary Cognitive Sciences. SALT has provided a leading annual international forum for semantics for the past 15 years. 2006 will mark the first time for it to be held outside the United States.
For more information, see here or http://research.nii.ac.jp/salt16/
24-25 March 2006, Colloquium "Modern Type Theory", IHPST, 13 rue du Four, F-75006 Paris, France
A two-day colloquium on Modern Type Theory will be held on Friday, March 24 and Saturday, March 25 at the IHPST in Paris.
For more information, see here or http://www-ihpst.univ-paris1.fr, or contact Mrs. Peggy Cardon at peggy.cardon at univ-paris1.fr.
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/
24-25 March 2006, Colloquium "Modern Type Theory", IHPST, 13 rue du Four, F-75006 Paris, France
A two-day colloquium on Modern Type Theory will be held on Friday, March 24 and Saturday, March 25 at the IHPST in Paris.
For more information, see here or http://www-ihpst.univ-paris1.fr, or contact Mrs. Peggy Cardon at peggy.cardon at univ-paris1.fr.
2006, Truth and Proof: Kurt Gödel and the Foundations of Mathematics
The year 2006 marks the centenary of Kurt Gödel's birth. This conference aims to bring together mathematicians and philosophers of mathematics to reflect on the foundations of mathematics, particularly in the light of Gödel's work.
For more information, see http://homepages.ed.ac.uk/s0090199/conference.htm
25-27 March 2006, CMCS 2006: Coalgebraic Methods in Computer Science, Vienna, Austria
During the last few years, it has become increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems, can be captured uniformly as coalgebras. Coalgebra is developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications.
For more information, see http://conferences.inf.ed.ac.uk/cmcs06/cmcs06.html
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/
2006, Truth and Proof: Kurt Gödel and the Foundations of Mathematics
The year 2006 marks the centenary of Kurt Gödel's birth. This conference aims to bring together mathematicians and philosophers of mathematics to reflect on the foundations of mathematics, particularly in the light of Gödel's work.
For more information, see http://homepages.ed.ac.uk/s0090199/conference.htm
25-27 March 2006, CMCS 2006: Coalgebraic Methods in Computer Science, Vienna, Austria
During the last few years, it has become increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems, can be captured uniformly as coalgebras. Coalgebra is developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications.
For more information, see http://conferences.inf.ed.ac.uk/cmcs06/cmcs06.html
25-28 September 2006,, AiML 2006: Advances in Modal Logic, Noosa (Queensland, Australia)
Advances in Modal Logic is an initiative aimed at presenting an up-to-date picture of the state of the art in modal logic and its many applications. The initiative consists of a conference series together with volumes based on the conferences.
AiML-2006 is the sixth conference in the series. For more information, see http://www.itee.uq.edu.au/~aiml06/
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/
25-27 March 2006, CMCS 2006: Coalgebraic Methods in Computer Science, Vienna, Austria
During the last few years, it has become increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems, can be captured uniformly as coalgebras. Coalgebra is developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications.
For more information, see http://conferences.inf.ed.ac.uk/cmcs06/cmcs06.html
27-31 March 2006, FOSSACS 2006: Foundations of Software Science and Computation Structures, Vienna (Austria)
FOSSACS will present original papers on foundational research with a clear significance for software science. The conference focuses on on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
For more information, see http://fossacs06.ru.is/
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-31 March 2006, FOSSACS 2006: Foundations of Software Science and Computation Structures, Vienna (Austria)
FOSSACS will present original papers on foundational research with a clear significance for software science. The conference focuses on on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
For more information, see http://fossacs06.ru.is/
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-31 March 2006, FOSSACS 2006: Foundations of Software Science and Computation Structures, Vienna (Austria)
FOSSACS will present original papers on foundational research with a clear significance for software science. The conference focuses on on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
For more information, see http://fossacs06.ru.is/
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-31 March 2006, FOSSACS 2006: Foundations of Software Science and Computation Structures, Vienna (Austria)
FOSSACS will present original papers on foundational research with a clear significance for software science. The conference focuses on on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
For more information, see http://fossacs06.ru.is/
30-31 March 2006, V.A.F. conference (Vereniging voor Analytische Filosofie), Vrije Universiteit Amsterdam, Philosophy Department
Keynote speakers: Timothy Williamson ('"Conceptual truth"/'Is justification in the head?'), Stefaan Cuypers ('The internalism/externalism debate on moral responsibility') and Jeanne Peijnenburg ('On the probability of a probability'). Contributed papers by: Betty, Blaauw, Coeckelberg, Connolly, De Clercq, De Nul, Derra, Douven, Hindriks, Horsten, Kirschenmann, Leilich, Lockhorst, Mueller, Myin, Romeijn, Slurink, van der Schaar, Van Kerckhove, Vasconez, Veldeman, Wilde
For more information and a programme, see http://www.filosofie.vu.nl/Nieuws/index.cfm/news_content.cfm/newsid/ or contact L.B.Decock at ph.vu.nl or C.van.Putten at ph.vu.nl.
15 July 2006, Workshop on Classical Logic and Computation (CL&C'06)
CL&C'06 is the first of a new conference series on "Classical Logic and Computation". It intends to cover all work aiming to propose a programming language inspired by classical logic, and a semantics for it
For more information, see http://www.doc.ic.ac.uk/~svb/CLaC
This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts outlining what will be presented at the workshop and of longer papers describing completed work, either published or unpublished. Submission deadline is 1 April 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/
27-31 March 2006, FOSSACS 2006: Foundations of Software Science and Computation Structures, Vienna (Austria)
FOSSACS will present original papers on foundational research with a clear significance for software science. The conference focuses on on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
For more information, see http://fossacs06.ru.is/
30-31 March 2006, V.A.F. conference (Vereniging voor Analytische Filosofie), Vrije Universiteit Amsterdam, Philosophy Department
Keynote speakers: Timothy Williamson ('"Conceptual truth"/'Is justification in the head?'), Stefaan Cuypers ('The internalism/externalism debate on moral responsibility') and Jeanne Peijnenburg ('On the probability of a probability'). Contributed papers by: Betty, Blaauw, Coeckelberg, Connolly, De Clercq, De Nul, Derra, Douven, Hindriks, Horsten, Kirschenmann, Leilich, Lockhorst, Mueller, Myin, Romeijn, Slurink, van der Schaar, Van Kerckhove, Vasconez, Veldeman, Wilde
For more information and a programme, see http://www.filosofie.vu.nl/Nieuws/index.cfm/news_content.cfm/newsid/ or contact L.B.Decock at ph.vu.nl or C.van.Putten at ph.vu.nl.
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/.