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.
| << February 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
|
||||
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/
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/
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/
3-4 April 2006, Thirteenth Workshop on Automated Reasoning, University of Bristol, Bristol, England
Continuing the highly successful series of Workshops on Automated Reasoning, this event will provide an informal forum for the automated reasoning community. The ARW workshop series aims to bring together researchers from all areas of automated reasoning in order to foster links and facilitate cross-fertilisation of ideas among researchers from various disciplines; among researchers from academia, industry and government; and between theoreticians and practitioners.
We invite interested persons to submit a camera-ready, two-page abstract about recent work or work in progress, or a system description. Anyone wishing to attend but not interested in presenting should send a shorter position statement (1/2 - 1 page).
Deadline for submission of papers is February 10th, 2006. For more information, see here, http://www.csc.liv.ac.uk/~clare/ARW/about.html or http://www.cs.nott.ac.uk/~mxw/arw06/
10-14 July 2006, ICALP 2006: 33rd International Colloquium on Automata, Languages and Programming, S. Servolo, Venice, Italy
The 33rd International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science EATCS will take place from the 9th to the 16th of July 2006 in Venice, Italy.
ICALP 2006 will be colocated with the 8th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming PPDP 2006.
For more information, see http://icalp06.dsi.unive.it/
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/
11-12 February 2006, Bonn Student Seminar on Set Theory and Games, Room P.327, Euclides Building, Plantage Muidergracht 24, Amsterdam
In this seminar, students from the mathematical logic group in Bonn are presenting various topic on games and set theory, leading up to Tony Martin's proof of the determinacy of all Π11 sets from a measurable cardinal.
All ILLC students interested in set theory are cordially invited to listen. The talks presuppose basic knowledge of set theory, comparable to our course Axiomatic Set Theory. The last two talks will also presuppose some knowledge about measurable cardinals.
Note that the Euclides building is closed on the weekend, so in order to attend, you either need to have an overwerkpass to get into the building, or to arrange a meeting with Stefan Bold to get into the building.
For more information, see http://staff.science.uva.nl/~bloewe/WS0506-Bonn.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-12 February 2006, Bonn Student Seminar on Set Theory and Games, Room P.327, Euclides Building, Plantage Muidergracht 24, Amsterdam
In this seminar, students from the mathematical logic group in Bonn are presenting various topic on games and set theory, leading up to Tony Martin's proof of the determinacy of all Π11 sets from a measurable cardinal.
All ILLC students interested in set theory are cordially invited to listen. The talks presuppose basic knowledge of set theory, comparable to our course Axiomatic Set Theory. The last two talks will also presuppose some knowledge about measurable cardinals.
Note that the Euclides building is closed on the weekend, so in order to attend, you either need to have an overwerkpass to get into the building, or to arrange a meeting with Stefan Bold to get into the building.
For more information, see http://staff.science.uva.nl/~bloewe/WS0506-Bonn.html
6-8 July 2006, 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), Riga, Latvia
The Scandinavian Workshop on Algorithm Theory (SWAT) is a biennial international conference, which alternates with the Workshop on Algorithms and Data Structures (WADS), intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Since 1988 SWAT has been held in the five Nordic countries, but this year's conference - the 10th in the series - will be held in the neighboring Baltic region, which has traditionally had a strong connection to the Nordic countries.
Early registration deadline is April 30. For more information and an online registratino form, see http://www.lumii.lv/swat/
We invite submissions of papers presenting original research on algorithms and data structures in all areas. The proceedings will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. Deadline for submission: February 13, 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/
31 August - 2 September 2006, The Fifth International Conference on Collective Intentionality (CollInt V), Helsinki, Finland
This international research conference is organised by the research project ''The We-Perspective, Social Institutions, and Social Change'' (directed by Prof. Raimo Tuomela) and the Philosophical Society of Finland. The main (but not the only) theme of the Helsinki conference is collective responsibility, and part of the conference will be devoted to this theme.
For more information, see http://www.valt.helsinki.fi/staff/tuomela/collint/
The Programme Committee cordially invites all researchers to submit their papers for presentation. Submission deadline is February 15, 2006.
10-12 July 2006, 7th Conference on Real Numbers and Computers (RNC7), LORIA, Nancy, France
The aim of the symposia on "Real Numbers and Computers" is to bring together specialists from various research areas, all concerned with problems related to computations based on real numbers. These computations may use any number system implemented by a software package or in hardware, including floating and fixed point, integers, rational or p-adic numbers, serial or on-line computations, continued fractions, fixed or multiple precision, interval and stochastic arithmetic.
For more information, see http://rnc7.loria.fr/
The conference will feature invited lectures and contributed talks. Original research results and insightful analyses of current concerns are solicited for submission. Survey and tutorial articles may be suitable for submission if clearly identified as such. Deadline for submission of manuscripts: February 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/
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/
3-5 July 2006, SIROCCO 2006: 13th Colloquium on Structural Information and Communication Complexity, Chester, United Kingdom
The Colloquia on Structural Information and Communication Complexity (SIROCCO) focus on the relationship between computing and communication, i.e., the study of those factors that are significant for the computability and the communication complexity of problems and on the interplay between structure, knowledge and complexity. The Colloquia provide an opportunity to bring together specialists interested in the fundamental principles underlying all computing through communication.
SIROCCO prides itself on being a lively venue, which encourages the emergence of new research areas (related to distributed computing in a broad sense) and the dissemination of original ideas. This is achieved by dedicating ample time for informal discussions and open problem sessions in addition to regular conference activities.
For more information, see http://sirocco06.csc.liv.ac.uk/
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/
4-7 April 2006, BCTCS 2006: 22nd British Colloquium for Theoretical Computer Science , Swansea, Wales, UK
BCTCS provides a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers.
Deadline for registration and contributions: February 20, 2006. For more information, an online registration form and a preliminary program, see http://www.cs.swan.ac.uk/bctcs2006/
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/
22-24 February 2006, WLP 2006: 20th Workshop on Logic Programming, Vienna University of Technology, Austria
The series of workshops on (constraint) logic programming serve as the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. Previous workshops have been held in Germany, Austria and Switzerland. The workshops provide a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation, and facilitate interactions between research in theoretical foundations and in the design and implementation of logic-based programming systems. The technical program of the workshop will include invited talks, presentations of refereed papers, and system demonstrations.
For more information, see http://www.kr.tuwien.ac.at/wlp06/
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/
22-24 February 2006, WLP 2006: 20th Workshop on Logic Programming, Vienna University of Technology, Austria
The series of workshops on (constraint) logic programming serve as the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. Previous workshops have been held in Germany, Austria and Switzerland. The workshops provide a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation, and facilitate interactions between research in theoretical foundations and in the design and implementation of logic-based programming systems. The technical program of the workshop will include invited talks, presentations of refereed papers, and system demonstrations.
For more information, see http://www.kr.tuwien.ac.at/wlp06/
27-29 April 2006, Horizons of Truth (Goedel Centenary 2006)
Logics, Foundations of Mathematics, and the Quest for Understanding
the Nature of Knowledge.
An International Symposium Celebrating the 100th Birthday of Kurt
Goedel.
Organized by the Kurt Goedel Society (http://kgs.logic.at/).
The Symposium will consist of more than 20 invited lectures by eminent scientists in the fields of logics, mathematics, philosophy, physics, cosmology, and theology. There will be a young researchers competition and a poster session, and a social program including a visit to Goedel's birthplace Brno.
For more information, including the list of invited speakers and an online registration form, please see http://www.logic.at/goedel2006/ or contact goedel2006team at logic.at
Young scholars (born on or after January 1, 1970) in logic, mathematics, physics, philosophy, computer science and theology are invited to submit project proposals. Submitted project proposals should be strongly connected to the scientific achievements including recent applications and/or life of Kurt Gödel. Ten chosen projects will compete for three top prizes. Submission deadline: Monday, 24. February 2006. 6 p.m. CET
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/
22-24 February 2006, WLP 2006: 20th Workshop on Logic Programming, Vienna University of Technology, Austria
The series of workshops on (constraint) logic programming serve as the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. Previous workshops have been held in Germany, Austria and Switzerland. The workshops provide a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation, and facilitate interactions between research in theoretical foundations and in the design and implementation of logic-based programming systems. The technical program of the workshop will include invited talks, presentations of refereed papers, and system demonstrations.
For more information, see http://www.kr.tuwien.ac.at/wlp06/
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/
23 May 2006, NWO - Bessensap, Nemo, Amsterdam
(dutch only)
NWO organiseert op 23 mei 2006 voor de zesde keer Bessensap. We doen
dat samen met de Vereniging Wetenschapsjournalisten Nederland (VWN) en met
science center NEMO. Het evenement brengt journalisten, redacteuren,
voorlichters en mediagenieke onderzoekers dichter bij elkaar. Het
motto: wetenschap ontmoet pers, pers ontmoet wetenschap.
Voor meer informatie, zie http://www.nwo.nl/bessensap
Onderzoekers kunnen voorstellen indienen voor drie presentatievormen
(meer info onderaan deze mail):
- traditionele presentatie
- masterclass presentatie
- korte film (nieuw dit jaar!)
Voorstellen indienen kan tot 27 februari
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