Open FoLLi Meeting and Reception

Posted under: Events; Program; Social Events.

As ESSLLI participants, you are also members of FoLLI, the Association for Logic, Language and Information. Your are all welcome at the FoLLI General Meeting, where you’ll get information about the current state and future developments of the Association.

The meeting will commence with an informal reception with something to eat and drink. After, the evening lecture of Johan van Benthem will commence.

Place/time: Thursday, August 19, 18.45-19.30
Location: 23.0.50

More Room Changes for Week 2

Posted under: Program.

Logic, Interaction and Collective Agency“, 11-12:30 will from Tuesday, August 17 moves to Auditorium 21.1.21

Theories of Information, Dynamics and Interaction and their Application to Dialogue“, 11-12:30 will from Tuesday, August 17 move to Auditorium 21.1.47

Logic, Rationality and Intelligent Interaction“, 14-15:30 will from Tuesday, August 17 move to Auditorium 21.1.21

Game Theoretic Pragmatics“, 14-15:30 will from Tuesday, August 17 move to Auditorium 21.1.47

Words and their Secrets“, 11-12:30 will from Tuesday, August 17 move to Auditorium 21.1.15

Compositionality“, 11-12:30 will from Tuesday, August 17 move to Auditorium 22.0.11

Larry Moss’ Course Rescheduled for Week 2

Posted under: Program.

Larry Moss’ course on “Logics for Natural Language Inference” has been rescheduled for the 2nd week of ESSLLI, Monday, August 16-20, 14:00-15:30, Auditorium 21.0.19.

Auditorium Change Week 2

Posted under: Program.

The course on “Interactive Machine Translation and Human Translation Processes“, 17:00-18:30 has been moved to Auditorium 22.0.11. The course on “Empirically-Based Multi-Modal Studies“, 17:00-18:30 has been moved to Auditorium 27.0.09.

Student Session Papers Online

Posted under: Course Material.

The full papers presented at the student sessions are now available for download. Visit the student session website for links.

ECTS Certificates

Posted under: ECTS Credits.

As of Thursday, August 12, 2010, students who have participated fully for the first week of courses and only is here for the first week may come to the registration desk and retrieve their ESSLLI 2010 Certificate worth 3 ECTS points.

Students who are here for the full two weeks may collect their ESSLLI 2010 Certificate 6 ECTS points starting Thursday, August 19, 2010 at the registration desk.

Places for Lunch

Posted under: Uncategorized.

Kulturhuset Islands Brygge — continue down Njalsgade to the waterfront, then Kulturhuset is on the left. Serves cheap-ish dishes.

Cavallino Pizzaria & Sandwich Bar — On Kongedybet 28, very close by. Serves nice Italian pizzas (50-60 kr.) and more. There are menus at the reception desk if you want to call down and order.

More Pizza: There are plenty of pizzarias around — this is a link to Google maps. Click “Search nearby” on the left and type in “pizza”. Some have websites with menus and numbers for pre-ordering.

Bagel House: There is also a bagel house a little up Amagerbrogade — see here.

Supermarkets: There are two supermarkets on Njalsgade, towards the water. The first from the site is SuperBrugsen, the second is Fakta, which is a bit cheaper. Both lie on the right hand side.

Course Postponed: Logics for Natural Language Inference

Posted under: Program.

The advanced course Logics for natural language inference to be held by Larry Moss has been postponed until further notice. At this point it is unsure whether the course may be held in week 2. to slot 3, week 2.

The course was to be held in week 1, 17.00-18.30. Other courses available in this period are:

LaCo:
Jong Sup Jun: Log-Linear Regression in Corpus Linguistics, introductory
Auditorium: 27.0.09

Patrick Juola: Authorship attribution and stylometry, introductory
Auditorium: 22.0.11

LoCo:
Olivier Gasquet and Andreas Herzig: Kripke’s World: an introduction to modal logics via tableau systems, foundational
Auditorium: 23.0.49

Dietrich Kuske: Automatic structures, advanced
Auditorium: 21.0.19

LoLa:

Olga Borik and Maarten Janssen: Formal Approaches to Thematic/ Semantic Roles, introductory
Auditorium: 21.1.21

Social Meeting Point: Islands Brygge

Posted under: Social Events.

Close to the ESSLLI 2010 site lies a waterfront park called Islands Brygge. Here, there is a free outside habor bath, lawns for sunbathing and great ice cream for those warm lunch breaks.

We will have a meeting point near Kulturhuset on Islands Brygge. Here we will meet in when going to various social events, and one may choose to look for fellow ESSLLI participants close by.

Students vs. Lectures Soccer Match

Posted under: Events.

On Saturday the 14/8, 14.00, the traditional students vs. lectures soccer match will take place. We have booked an 11 person field at Kløvermarken, in the period 14.00-16.00. The teams will be made in an unformal fashion on site.

A walking party will depart from the social meeting point at Islands Brygge at 13.00 — when the boat sightseeing  tour returns to the same location.

ESSLLI 2010 Party

Posted under: Events; Social Events.

On Saturday 14/8 the official ESSLLI 2010 party will be held at “Mødestedet” — at staircase 17 of  KUA.

The official party will run from 20.00-02.00. There is a bar with student friendly prices on site., and the entrance will of course be free. We hope all students and lectures will attend!

Beth Dissertation Award 2010 — Thesis Presentation

Posted under: Events.

The 2010 E.W. Beth Dissertation Prize has been awarded to Yury Savateev (Moscow State University) for his thesis ‘Algorithmic Complexity of Fragments of the Lambek Calculus’. The official announcement of the winner will take place at the Official Reception on Friday, August 13. In addition the laureate will give a presentation of his work on Thursday, August 19 in connection with the student session at 15.45 in room 23.0.49.

Course Cancellation: Psychological Reality of Semantic Theories

Posted under: Program.

Due to unforeseeable circumstances, the foundational LoLa course Psychological Reality of Semantic Theories to be held by Hans Kamp has been cancelled.

The course was to be held in week 1, from 9.00-10.30. Other courses available in this period are

LaCo:

Anna Feldman and Jirka Hana: Resource-light Morpho-syntactic Analysis of Highly Inflected Languages, foundational
Auditorium: 27.0.09

Remi van Trijp and Martin Loetzsch: Evolutionary Linguistics, introductory
Auditorium: 22.0.11

LoCo:
Mohammadreza Mousavi and Michel Reniers: Structured Operational Semantics, introductory
Auditorium: 23.0.49

Wojtek Jamroga and Wojtek Penczek: Specification and Verification of Multi-Agent Systems, advanced
Auditorium: 21.0.19

LoLa:
Fritz Hamm and Yiannis Moschovakis: Sense and denotation as algorithm and value, advanced
Auditorium: 21.1.15

Welcome to ESSLLI 2010!

Posted under: Uncategorized.

Dear ESSLLI 2010 participants,

Hopefully you have all arranged your transport to Copenhagen by now and are getting ready to depart. Before you do so, we, the ESSLLI 2010 Organization Committee have a few pieces of relevant information.

When you get here: We have compiled a short text on getting from the airport to Hotel Astoria and DanHostel Copenhagen City with maps and guides to public transport. See http://esslli2010cph.info/wp-content/uploads/What-to-Do-when-You-Get-Here.pdf

Clothing: In Denmark, we can never eliminate the possibility of rain, so bringing an umbrella is not a bad idea. Hopefully we will have a sunny two weeks where short sleeves and shorts will be the most comfortable during the day, long sleeves and pants for the evenings. For daily weather reports for Copenhagen, see http://www.dmi.dk/dmi/index/danmark/byvejr_danmark.htm?by=1000.
Further, both DanHostel Copenhagen City and the ESSLLI 2010 site are located close to a free harbor bath with lawns for hanging out. If you wish to take a dive, bring swimsuits and towels! Further, there is the Students vs. Lectures soccer match and the ESSLLI party — both without particular dress-code.

A Social Approach: Various social events have been planned and for those interested, Copenhagen offers more. In order to coordinate with each other in an open forum, a Facebook group has been set up — see http://www.facebook.com/home.php?#!/group.php?gid=295538205364&ref=ts

Course material and preparation: All course material is now available in one zipped archive here: http://phis.ruc.dk/ESSLLI2010_Course_Material.zip
If you have problems unpacking the file, or extract only 15, and not 32, files, try using 7-zip: http://www.7-zip.org/ .
No hardback version will be available, so print from home.
Further, some course maintain their own, external websites, so make sure that you check the updated course descriptions on the website. In particular, if you plan on attending either Painless NLP Programming with UIMA or Authership Attribution and Stylometry, you should pre-install the required software.

We look forward to seeing you all in Copenhagen!
The ESSLLI 2010 Organizing Committee

Course Material Download

Posted under: Course Material.

All course material can now be downloaded in one zip-archive here: http://phis.ruc.dk/ESSLLI2010_Course_Material.zip

The archive includes 32 files. If you have a problem unpacking or find only 15 files in Windows, try using 7-zip.

Hardcopies of the materials will not be handed out on site, so please print for the relevant courses from home. Not all courses have material included, but maintain external websites. Please ensure that you check the course descriptions as well, as links and instructions may be found there.

Sightseeing Tour of the Copenhagen Canals

Posted under: Events; Social Events.

Being a waterfront city, many of the older sites of Copenhagen lies near some waterfront, and through the inner city runs old canals. We have arranged two guided sightseeing tours through the habour and canals of Copenhagen, one Saturday 14 at 12.00 and Sunday 15 at 14.00. The guides will provide information on the main sights and the most interesting moments in Copenhagen history in English.

Cheap tickets (50 DKR ~ 6½ €) for the tours will be sold at the Registration and Information Desk at the ESSLLI 2010 site — cash DKR only! There are  150 tickets available for each trip.

We will meet at the social meeting point at Islands Brygge at 11.45 on Saturday and 13.45 on Sunday and walk the short distance to the boat.

IMPORTANT: Installation instructions for the course ‘Painless NLP Programming with UIMA’

Posted under: Course Material.

Painless NLP Programming with UIMA is a practical course. In order to attend the course, you need to bring your own laptop configured appropriately. This mini guide explains how to install the necessary software so you can start using UIMA and participate in the exercises from day one. It is ESSENTIAL that your laptop be configured correctly BEFORE the start of the course because there will be no time to set up individual laptops during the course. The installation instructions will provide you with all the necessary information to help you set up your environment. If you feel these instructions are not sufficient or if you are having any difficulties in setting up your laptop, please contact us by email ({jordi.atserias|bart.mellebeek}@barcelonamedia.org}) before the start of the course. Once the course has started, there will be no time to set up individual laptops.

When You Get Here

Posted under: What to do when you get here.

The following document includes information for both lectures staying at Hotel Astoria and sudents staying at DanHostel Copenhagen City on getting from airport to accommodation and form accommodations to the ESSLLI 2010 site.

What to do when you get here.pdf

Evening Lectures Program and Locations

Posted under: Evening Lectures; Program.

Dov Gabbay (Kings College London, University of Luxembourg, and Bar Ilan University, Israel)
Title: Integrating Logic Reasoning and Network Reasoning
Date and Time: Tuesday, August 10: 19:00-21:00
Auditorium: 23.0.50

Shalom Lappin (King’s College London)
Title: The Richness of the Stimulus: Confessions of a Nascent Empiricist
Date and Time: Thursday, August 12. 19:00-21.00
Auditorium: 23.0.50

Johan van Benthem (University of Amsterdam and Stanford University)
Title: Logical Dynamics of Rational Agency
Date and Time: Thursday, August 19. 19:00-21.00
Auditorium: 23.0.50

Neil Jones (University of Copenhagen)
Title: Properties of a program’s runtime state space
Date and Time: Tuesday, August 17. 19:00-21:00
Auditorium: 23.0.50

Venue Address and Campus Map

Posted under: Locations and Maps.

The official address of ESSLLI 2010 is

ESSLLI 2010
Building 22
Humanities Campus
Emil Holms Kanal
DK2300 Copenhagen S
Denmark

Registration and Meeting Area, ground floor of building 23
There is free wireless web-access on the ground floors of buildings 22-24 on the network entitled SC Guest

Google Maps
Campus Map

Formal Grammar 2010

Posted under: Events; Formal Grammar 2010.

FG-2010 is the 15th conference on Formal Grammar, to be held in conjunction with ESSLLI 2010 during August 7-8. The conference will take place in Auditorium 21.1.15.

Previous Formal Grammar meetings were held in Barcelona (1995), Prague (1996), Aix-en-Provence (1997), Saarbruecken (1998), Utrecht (1999), Helsinki (2001), Trento (2002), Vienna (2003), Nancy (2004), Edinburgh (2005), Malaga (2006), Dublin (2007), Hamburg (2008) and Bordeaux (2009).

For more information, please visit the Formal Grammar 2010 website

Early Bird Registration closes June 1

Posted under: Events; Registration and Accommodations.

The Early Bird registration offer for participation at ESSLLI 2010 expires on June 1. After June 1, it will no longer be possible to register for the reduced registration fee.

The ESSLLI 2010 organization committee strongly encourages students and other participants to both register and book accommodation before June 1. A limited amount of rooms are still reserved at DanHostel Copenhagen City, but these rooms will soon be available to for booking by regular tourists coming to Copenhagen during the summer.

For more information, go to the registration and accommodation pages.

Registration and Accommodation for Workshop Organizers

Posted under: For Workshop Participants; Registration and Accommodations.

ESSLLI 2010 workshop organizers, participants and invited speakers should refer to

http://esslli2010cph.info/?p=448 for information on accommodation.

Additionally, please note that participants and invited speakers at workshops are supposed to register (and pay a registration fee) at ESSLLI in order to participate in the workshop. We may subsequently, with an emphasis on MAY, may be able to provide some fee reimbursement for workshop invited speakers, but that will in the end depend on the number of registered participants at your workshop, so please do your best to attract wide participation.

For additional queries, please contact OC Chair, Vincent F. Hendricks @ esslli2010cph@gmail.com.

Frequently Asked Questions and Answers

Posted under: Frequently Asked Questions and Answers.

Q: Will I be able to attain ECTS points for attending ESSLLI 2010?
A: Yes. The University of Copenhagen have agreed to award each full time student at ESSLLI 2010 3 ECTS credits a week. A full time student is defined by attending and preparing for courses and workshops in slots 1-4 of each day. The maximum number of ECTS credits for ESSLLI 2010 is 6 given full time participation in both weeks of courses.

Q: Is ESSLLI 2010 open to anyone?
A: Yes, anyone register. There is no selection procedure for participants and being a student is not a requirement, though there is a lower registration fee for student. For more information on registration, go to the registration page.

Q: Are students required to submit a paper in order to attend?
A: No. No paper submissions are required, only registration is. For more information on registration, go to the registration page.

Q: How many lectures a day do participants need to take?
A: None. All participants are free to attend any and all course of workshops available at ESSLLI 2010. During registration, you will be asked to indicate which courses and workshops you plan to attend. This is non-committal, but gives an indication for the organization committee of which courses requires larger rooms, etc.

Q: Is it possible to register for one week only and save money on the registration fee?
A: No. Only two week registration is possible, though participants are free to attend any and all intervals of ESSLLI 2010.

Q: The accommodation deadline has passed. Is it to late to book rooms at DanHostel Copenhagen City?
A: Maybe. A package deal was guaranteed availability until May 4, 2010. The rooms are now open to be booked by other tourists. We recommend contacting DanHostel as soon as possible regarding accommodation. Rooms at DanHostel Copenhagen City are both the closest and cheapest accommodation available. For more information, go to the accommodation page.

For any other further queries regarding registration, accommodation, etc. issues, please inquire from the organizers, on esslli2010cph@gmail.com.

Registration and Accommodation for Lectures

Posted under: For Lectures; Registration and Accommodations.

Lecturers should not register through the ESSLLI 2010 website. Instead, please register directly with executive officer Tinna Kryger @ tkryger@ruc.dk. Be sure to state:

Name:
Affiliation:
Date of Birth:
Course:
Course week:
Date of Arrival:
Date of Departure:

The ESSLLI organization will reimburse lecturer travel expenses with a flat rate of 300 euros within Europe and 500 euros outside. Reimbursements are due after ESSLLI 2010 has been held. If there are 2 or more lecturers for a course, ESSLLI will ONLY reimburse 1 lecturer pertaining to travel expenses.

Free accommodations at one of the conference hotels – Hotel Centrum or Hotel Astoria – for lecturers is also provided by ESSLLI 2010 for one week (5 working days, either August 8-13, or August 15-20) and one lecturer only. If there are 2 or more lecturers for a course, ESSLLI will ONLY cover the hotel accommodations for 1 lecturer for one course week (5 working days). Additional room nights may be purchased at own expense. Lecturers giving a course at ESSLLI should contact executive officer Tinna Kryger @ tkryger@ruc.dk for booking of accommodations with “Lecturer Hotels ESSLLI 2010” in the subject entry.

Additional lecturers are eligible for reduced rates at one of the two conference hotels. Please refer to page http://esslli2010cph.info/?page_id=121 for information about reduced rates.

Accommodation Booking Deadline May 3

Posted under: Registration and Accommodations.

The deadline for booking accommodations with package deals at the ESSLLI summer school venue is May 3, 2010. Availability of rooms at Danhostel Copenhagen City cannot be guaranteed after this date. Please visit website for more:

http://esslli2010cph.info/?page_id=121

Travel Grants — Application deadline May 15

Posted under: Travel Grants.

NOTE!!!
THE APPLICATANTS WHO HAVE RECEIVED AN ESF-TRAVEL GRANT HAVE BEEN INDIVIDUALLY  NOTIFIED ON MAY 25, 2010!

ESSLLI2010 have received a number of travel grants from the ESF – European Science Foundation. Each grant is for 500 euros. The regulations for being eligible for a travel grant according to the ESF reads:

The funding awarded should be used for travel and subsistence support for the active participation of European Early Career Researchers (see note 1) (i.e., researchers affiliated to European universities or research institutes in countries having agencies that are Member Organisations of the ESF; for a full list see: http://www.esf.org/about-us/80-member-organisations.html).

In order to be considered for such a grant please write ESSLLI 2010 Organization Chair, Vincent F. Hendricks @ esslli2010cph@gmail.com. Be sure to include all necessary contact details and student status and documentation that your institution is a Member Organisation of the ESF.

Be sure to include the following information in your application:

- First name:
- Last name:
- Status: PhD student since ….
- Affiliation:
- Email address:
- Mailing address:
- Phone number:
- Fax number: 

DEADLINE FOR APPLICATIONS IS MAY 15, 2010. NOTIFICATION DEADLINE IS MAY 25, 2010.

CfP Deadline Extended for Workshop on Dependence and Independence in Logic

Posted under: Workshop Calls for Papers.

The deadline for submissions to the workshop on Dependence and Independence in Logic has been extended to April 25, 2010.

For more information on the workshop, please see http://esslli2010cph.info/?p=321

Evening Lecture: Neil Jones

Posted under: Evening Lectures.

Neil Jones (University of Copenhagen)

Properties of a program’s runtime state space

It is well known that any interesting property of programs is in general undecidable (unsolvability of the halting problem; Rice’s theorem). Nonetheless, in practice it can be essential to obtain definite information about a program’s behavior: will it terminate on given inputs, will it never commit certain errors, will it run in polynomial time (in the input’s size), and many more properties. One way out of this dilemma is to consider non-Turing complete classes of programs. Another is to develop “one-sided” analyses, whose positive results are reliable, but which may answer “don’t know”.

Given a program P and an input, the computation by P on the input may finite or infinite; and there may be many computations, e.g., if P is nondeterministic. One analysis approach is to find correct descriptions of the set of all computational states that P may enter while running, and to discover properties of this set, and the relations among reachable states. In addition to soundness, a condition relevant to computer science is that the analyses should be automatable.

This evening lecture will overview a number of approaches to the problem; possible topics include relations between programs and finite model theory, complexity of read-only programs, termination analysis by the size-change and related methods, and analysis of program running times.

Slides are available at http://www.diku.dk/hjemmesider/ansatte/neil/ESSLLI12August.pdf

Evening Lecture: Johan van Benthem

Posted under: Evening Lectures.

Johan van Benthem (University of Amsterdam and Stanford University)

Logical Dynamics of Rational Agency

If logic is at heart about information-driven rational agency and intelligent interaction, what follows? Come, and find out.

Literature: J. van Benthem, 2010, “Logical Dynamics of Information and Interaction”, Cambridge University Press.

Evening Lecture: Shalom Lappin

Posted under: Evening Lectures.

Shalom Lappin (King’s College London)

The Richness of the Stimulus: Confessions of a Nascent Empiricist

The view that language acquisition requires a special purpose learning mechanism encoded as a Universal Grammar depends heavily on arguments to the effect that the primary linguistic data for acquisition is too impoverished to allow for efficient language acquisition through domain general learning procedures. A careful consideration of the evidence for different versions of this argument from the poverty of the stimulus shows that it does not sustain its main conclusions. Recent work on grammar induction, coming from a variety of fields, supports the view that efficient learning with domain general inductive methods, informed by comparatively weak language specific constraints, is possible. This talk is based on research presented in my co-authored monograph Alexander Clark and Shalom Lappin (2010), Linguistic Nativism and the Poverty of the Stimulus, Wiley Blackwell, Oxford and Malden, MA.

Evening Lecture: Dov Gabbay

Posted under: Evening Lectures.

Dov Gabbay (Kings College London, University of Luxembourg, and Bar Ilan University, Israel)

Title: Integrating Logic Reasoning and Network Reasoning

Abstract:
In the past half century various formal tools have been proposed for the study of human behaviour in daily life. Such tools were developed in computer science, communication, artificial intelligence, language study, law, analytic philosophy, psychology and cognition, among others. Main among these tools are the formal logical systems (classical logic, non-monotonic logics, modal and temporal logics, etc, etc.) and various network models such as argumentation networks, neural networks, Bayesian networks, inheritance networks, and more. There is no unifying view for all these tools, and in fact they are developed by completely different international communities with very little common ground and communication and yet (see below) all of these features of human behavior (logics and networks) do reside coherently in the individual human mind and enable him to function intelligently in his day-to-day activity.

There is some realization among a few of these diverse communities that communication between them needs to take place and unifying principles are indeed sought. Unfortunately not much is known and certainly no coherent and successful unifying view exists. The mission of this lecture to provide such a view. The value of a unified model goes beyond just a unifying formal theory. Even if we take the view that each of these components model a different aspect of the human (constructed as a model for the purpose of installing on a computer or a robot) a unified theory can help extend their range of applicability and help integrate them better. But we hope for more. We hope that such a model built up carefully might give us a better insight on how people actually reason. Something of great interest to the philosopher, psychologist, linguist and cognitive scientist. A unified theory would be a better, sharper tool in their hands.

ESSLLI 2010 Poster

Posted under: Poster; Program.

The official poster for ESSLLI 2010 in Copenhagen, Denmark, August 9-20, 2010 is now available here.

Student Session submissions deadline extended

Posted under: Events; Proposal Deadlines.

Please note that the deadline for submissions for the eSSLLI 2010 Student Session has been extended to March 3rd, 2010.

For more information, please visit the Student Session website.

Course and Workshop Descriptions Online

Posted under: Course and Workshop Descriptions.

Descriptions of the courses and workshops accepted for ESSLLI 2010 are now online.

These descriptions are listed below and under the menu point Course and Workshop Descriptions on the left, or browsed by the categories Language and Computation, Logic and Computation, Logic and Language and Other.

From the menu above, the Program button will take you to the program schedule, and from here each course and workshop is available.

Focus

Posted under: Course and Workshop Descriptions; Logic and Language.

The phenomenon of intonational focus is illustrated by the difference in truth conditions between “He only introduced BILL to Sue” and “He only introduced Bill to SUE”, and by phrases with inherent contrastive potential such as “in MY opinion” and “it’s a SMALL town”.  Here capitalization indicates a prominence that is marked by phonetic factors including pitch contour and duration.   The course introduces phenomena and theories of focus at the levels of phonetics, phonology, syntax, semantics and pragmatics, and the interfaces between them.   Common grammatical and contextual environments that trigger focus are surveyed.   We will look in detail at the most prominent accounts of the semantics of focus, namely alternative semantics and entailment semantics, and consider how they are applied in particular cases.  An important issue is the character of the phonology-semantics interface: focus plainly involves a correlation between phonetic-phonological features and semantic-pragmatic ones.  Additional topics include issues of grammatical representation including scope; interactions with ellipsis and bound variables; focus in the pragmatics of the question-answer relation; the hypothesis that focus and question phrases have a single compositional semantics; focus intonation in Japanese question phrases; experimental and corpus methodologies; the semantics and pragmatics of topic accents.  The course aims to cover the basics together with exciting current issues, without assuming background in linguistics.

Evolutionary Linguistics

Posted under: Course and Workshop Descriptions; Language and Computation.

This course introduces the students to Evolutionary Linguistics, a field that uses a systematic methodology for investigating the evolution of linguistic phenomena. This involves the following steps:
(a) Identify and reverse-engineer a specific language system;
(b) Identify its function in communication;
(c) Identify the language strategy that is needed for learning, expanding and aligning such a system;
(d) Understand how this language strategy may have originated;
(e) Show the selective advantage of the strategy.
At each step, computational models and robotic experiments are carried out to ensure that a proposed theory works. The goal of this course is to provide students with a clear insight into each aspect of the methodology and what skills are required to join this exciting field. The tentative schedule of the course is as follows:
1. Day 1 – “What is Evolutionary Linguistics”: The first lecture introduces the main research objectives of Evolutionary Linguistics and offers an overview of the proposed methodology. The theoretical framework is illustrated through the domain of colour.

2. Day 2 – “Embodiment”: This lecture talks about the challenges of embodiment in this research, including video demonstrations of robots that engage in communicative interactions in a real-world setting.

3. Day 3 – “Concept and lexicon formation”: This lecture shows experiments on the self-organization of vocabularies in speech populations. These experiments show how embodied agents create conceptual distinctions and exploit language for sharing these distinctions.

4. Day 4 – “Conceptualization”: This session deals with complex conceptualizations through the domains of spatial language and posture verbs. The class introduces the students to IRL, a computational tool for doing experiments on Incremental Compositional Semantics.

5. Day 5 – “Grammar”: The final session illustrates how to implement experiments on the evolution of grammar. Here, the domain of event structure is chosen. The students are introduced to Fluid Construction Grammar (FCG), a grammatical formalism that was especially designed for experiments on Evolutionary Linguistics.

Further particulars (e.g, prerequisites):
Students who bring their own laptops can freely install all software that will be used in the sessions so they can follow the demonstrations or even try some exercises themselves.

FURTHER REFERENCES

Introduction

Embodiment and language games

  • Martin Loetzsch and Michael Spranger. Why robots? In A. D. Smith, M. Shouwstra, B. de Boer, and K. Smith, editors, Proceedings of the 8th International Conference on the Evolution of Language (EVOLANG 8), pages 222-229, 2010. World Scientific.
  • Luc Steels (2001). Language games for autonomous robots. IEEE Intelligent systems, 16(5):16-22 October.

Concept and word formation

Conceptualization

Grammar

Software download (open source)

Other publications


Theories of information dynamics and interaction and their application to dialogue

Posted under: Course and Workshop Descriptions; Logic and Language.

Theoretical approaches to communication and dialogue modeling are varied and often unrelated because separately focusing on different aspects of dialogue (speech acts, goals, beliefs, plans, questions, conventions, roles, cooperation, disputes, argumentation, reference, semantics-pragmatics interface…).

On the other hand, the area of foundations of multi-agent systems is inducing new developments in logics of interaction and information dynamics, with a recent trend towards comparison and integration.

Analyzing the impact of this trend on communication and dialogue modeling is timely.

This workshop aims at discussing formal theories and logics of information dynamics and interaction and their applications to dialogue and communication modeling. It is intended to bring together logicians, linguists and computer scientists in order to provide a better understanding of the potentialities and limitations of formal methods for the analysis of dialogue and communication. Its scope includes not only the technical aspects of logics, but also multidisciplinary aspects from linguistics, philosophy of language, philosophy of social reality, social sciences (social psychology, economics).

The following are some examples of formal theories and logics that are relevant to the workshop (no order):

  • speech act theory,
  • argumentation theory,
  • game theory,
  • public announcement logic,
  • dynamic epistemic logic (DEL),
  • logics of agency and power (e.g. STIT, ATL, Coalition Logic),
  • theories of persuasion,
  • theories of commitment,
  • dynamic semantics,
  • semantic approaches to interrogative clauses,
  • rhetorical approaches to dialogue (e.g., Segmented Discourse Representation Theory).

    The focus of the workshop will be on recent developments, especially those that combine several approaches (e.g. dynamic epistemic logic and speech act theory, dynamic epistemic logic and segmented discourse representation theory, public announcement logic and commitment theories, STIT and dynamic epistemic logic, Coalition Logic and public announcement logic…) to deal with complex dialogue and communication phenomena.

    Invited speakers:
    Patrick Blackburn, LORIA, INRIA Nancy;
    Jeroen Groenendijk, ILLC, University of Amsterdam

    Selected papers will be published in a special issue of the journal Synthese

    Information and Call for Papers: http://www.irit.fr/~Laure.Vieu/Esslli10

  • Dependency grammar for computational linguists

    Posted under: Course and Workshop Descriptions; Language and Computation.

    Dependency grammar has become one of the central linguistic theories in computational linguistics because of its simplicity and the advent of dependency-based methods for parsing and machine translation. In this course we will see how to turn dependency grammar into a full-fledged linguistic theory that can account for even sophisticated linguistic phenomena, such as discontinuous word orders, secondary dependencies (filler-gap constructions), elliptic coordinations (gapping coordinations), speech repairs, discourse and anaphora. We will also show how to build dependency-based generative probability models that can account for these phenomena probabilistically. The course is structured as follows:

    day 1: general introduction, complement-adjunct distinction, treebanks

    day 2: accounting for discontinuous word-orders by means of surface trees, deep trees, and an upwards movement principle: topicalizations, extrapositions, scrambling, cleft sentences

    day 3: accounting for secondary dependencies by means of filler licensors and phonetically empty fillers: verbal chains, relatives, control constructions, simple elliptic coordinations, parasitic gaps

    day 4:  fillers that represent entire subtrees where the leaves can be replaced by new material: gapping coordinations and speech repairs

    day 5: anaphora, discourse structure, and complex morphology

    Each lecture will introduce linguistic insights, illustrated by examples from the Copenhagen Dependency Treebanks (100,000 word parallel treebanks for Danish and English, with large parallel subtreebanks for Italian, Spanish, and from 2010 German). As teaching material, I intend to use the book “Discontinuous Grammar: A dependency-based model of human parsing and language learning”, VDM Verlag, 2009 (virtually identical to my dr.ling.merc. dissertation which is available free online from http://www.buch-kromann.dk/matthias/thesis).

    Implicit Computational Complexity

    Posted under: Course and Workshop Descriptions; Logic and Computation.

    Implicit Computational Complexity studies machine-free logic-based characterizations of computational complexity classes. Various branches of mathematical logic have been affected by this line of research, including recursion theory, model theory and proof-theory. In this course, we will give an introduction to implicit computational complexity. We then give more insights on some  specific correspondence results between complexity classes (polynomial time, elementary time, polynomial space, etc.) on one side and logical systems (function algebras, systems coming from proof theory) on the other.

    Further particulars:
    Having a basic knowledge about computational complexity, recursion theory and proof theory is not a prerequisite, although it would probably help while attending this course.

    Ehrenfeucht-Fraïssé Games: Applications and Complexity

    Posted under: Course and Workshop Descriptions; Logic and Computation.

    The method of Ehrenfeucht-Fraïssé (EF-game for short) provides a characterisation of $m$-equivalence for first-order logic, which can be easily adapted to other logical languages (second-order logics, fixed-point logics, modal logics, etc…). Besides, it has special relevance to finite model theory, where other model-theoretic techniques, such as the Compactness Theorem or the Löwenhein-Skolem theorem, cannot be applied.

    In the first part of the course we introduce the fundamental notions related to Ehrenfeucht-Fraïssé games as logical combinatorial games. In particular, we describe the correspondence between formulae and games, we analyze the notions of winning strategies, the remoteness of a game and the optimal (as opposed to winning) strategies for a player. Then, we illustrate some important applications of the Ehrenfeucht-Fraïssé method, such as Hanf’s theorem.

    In the second part of the course we present some general sufficient conditions that can be used to prove inexpressivity results, such as Arora and Fagin’s theorem and Schwentick’s theorem. Moreover, we describe Gaifman’s theorem and subsequent results about normal forms for first-order logic.

    In the third part of the course, we focus on algorithmic questions related to EF-games. We discuss the known complexity results about EF-games (e.g., how hard is it to compute the winner of a game and/or its winning strategy? What is the remoteness of an unbounded game?), in general and for specific classes.

    In the last part of the course, some significant  variants of EF-games (e.g., pebble games and second-order games) are reviewed and the most significant applications to logic are discussed.

    Learnable Representations of Languages

    Posted under: Course and Workshop Descriptions; Language and Computation.

    This course addresses the learnability of language; we will discuss the theory of grammatical inference as it relates to learnability issues in language acquisition. None of the levels of the Chomsky hierarchy are learnable for reasons of computational complexity.
    However, we now understand that this does not rule out the existence of representations that are learnable. We will discuss a hierarchy of models that are based on observationally defined representations.
    The first model will be deterministic finite state automata, whose canonical representation is learnable through the Myhill-Nerode theorem. Associated learning algorithms include Angluin’s reversible automata, and stochastic models such as Clark and Thollard (2004). The second model consists of context free grammars, where the non-terminals correspond to congruence classes of the language; this gives rise to the substitutable languages and the learning algorithms for NTS languages considered in Clark and Eyraud (2007). The final class is a richer context sensitive class based on the theory of residuated lattices. These are perhaps powerful enough for natural language syntax; preliminary version of this was published as Clark (2009) at Formal Grammar.

    Day 1:  Learnability and the argument from the poverty of the stimuls
    Day 2:  Learnability of regular languages; canonical DFAs and the Myhill-Nerode theorem
    Day 3: The syntactic congruence; elementary properties; NTS languages, substitutable languages
    Day 4: The syntactic concept lattice; lattice grammars
    Day 5: Linguistic implications;

    Day 1 of this course is based on a course I taught at the Linguistics Summer Institute in Stanford in 2007 with Prof Shalom Lappin.

    Computational Modeling of Human Language Acquisition

    Posted under: Course and Workshop Descriptions; Language and Computation.

    FIRST SESSION,  MONDAY 16th CANCELLED. Hereafter, the course proceeds as planned.

    The nature and amount of information needed for learning a natural language, and the underlying mechanisms involved in this process, are the subject of much debate: is it possible to learn a language from usage data only, or some sort of innate knowledge and/or bias is needed to boost the process? This is a topic of interest to (psycho)linguists studying human language acquisition, and to computational linguists developing large-scale natural language processing systems. Children are a source of inspiration for any such study of language learnability: they learn language with ease, and their acquired knowledge of language is flexible and robust. Computational modeling of language learning has become a popular approach for explaining the developmental patterns observed in children. Such models can provide insight into the mechanisms involved in human language acquisition, and also provide ideas for developing better language processing techniques.

    This course discusses the main research topics in computational modeling of language acquisition, and reviews common approaches to developing and evaluating such models. The first part of the course focuses on more general issues, such as different views on language modularity, and the major arguments on language learnability and innateness. We review widespread computational frameworks used for investigating these topics and integrating the theoretical assumptions into a computational model. We also look at how such computational models can be evaluated based on the existing child-directed and child-produced data, and psycholinguistic findings of human language acquisition.

    The second part takes a closer look at some of the existing models of language learning. We discuss general trends in  computational modeling over the past decades, including symbolic, connectionist, and probabilistic modeling. We also review a number of more influential models of the acquisition of different aspects of language, including word segmentation (i.e., separating a stream of speech into words), syntax (e.g.,the formation of the lexical categories, the acquisition of word order), and semantics (e.g., learning word meanings, and mapping a grammatical structure to a meaning representation). Finally, we explore some available tools and resources for implementing and evaluating computational models of language acquisition.

    Specification and Verification of Multi-Agent Systems

    Posted under: Course and Workshop Descriptions; Logic and Computation.

    Multi agent systems (MAS) provide an important framework for formalizing various problems in computer science, artificial intelligence, game theory, social choice theory, etc. Modal logics are amongst the most suitable and versatile logical formalisms for specification and verification of computational systems. The course offers an introduction to some important developments in the area. We introduce modal logics used for specification of temporal, epistemic, and strategic properties of systems; then, we present model checking algorithms based on SAT, and discuss the computational complexity of the model checking problem. We also consider symbolic (compact) representations of systems, and how the representations change the semantic and algorithmic side of model checking. Finally, we discuss some techniques that help to reduce the complexity and make verification feasible even for large systems.

    Preliminary outline:
    1. Reasoning about evolution of systems:
    modal logic, Kripke models, epistemic logic, temporal logic, linear vs. branching time,  synchronous vs. asynchronous semantics, reasoning about knowledge and time, logics for real time.
    2. Introduction to model checking for knowledge and time:
    standard non-symbolic algorithms, basic complexity results, state-space explosion,  reduction methods (partial-order, abstraction), introduction to symbolic model checking.
    3. Specification of agents and their teams:
    strategic logics, ATL, imperfect information scenarios.
    4A. Model checking for real time and knowledge:
    timed automata, detailed region graphs, timed CTLK, standard non-symbolic model checking.
    4B. Complexity of verification:
    model checking complexity for explicit models, complexity revisited: higher-order representations.
    5. Practical model checking:
    SAT-based approach to model checking, bounded and unbounded model checking, reduction methods, demonstration and experimental results (VERICS).

    Further particulars (e.g, prerequisites):
    This is an introductory course and the participants are only expected to have basic background in logic.  Basic knowledge of modal logic, complexity theory, and multi-agent systems will be an advantage (but it is not necessary).

    Proof Complexity of Non-Classical Logics

    Posted under: Course and Workshop Descriptions; Logic and Computation.

    Proof complexity is an interdisciplinary area of research utilizing techniques from logic, complexity, and combinatorics towards the main aim of understanding the complexity of theorem proving procedures. Traditionally, propositional proofs have been the main object of investigation in proof complexity. Due their richer expressivity and numerous applications within computer science, also non-classical logics have been intensively studied from a proof complexity perspective in the last decade, and a number of impressive results have been obtained.

    The aim of this course is to present an up-to-date introduction to proof complexity with emphasis on non-classical logics and their applications. In particular, we will cover proof systems for modal logics, intuitionistic logics and non-monotonic reasoning. The course will introduce the relevant logics and explain in detail the proof systems associated with them. One of the main objectives in proof complexity is to obtain tight bounds on the size of proofs. In the course we will explain the method of feasible interpolation as one universal technique for proving lower bounds for the proof size. Feasible interpolation has been demonstrated for intuitionistic logic and a number of modal logics, which subsequently lead to exponential lower bounds for the proof size of combinatorial statements in these logics.

    These proof-theoretic results will be complemented by illustrative examples  showing the applicability of proof systems for non-classical logics to AI and automated theorem proving. Practitioners are not only interested in the size of a proof, but face the more complicated problem to actually construct a proof for a given instance. Thus we will discuss aspects of proof automatizability, proof search, and algorithms for satisfiability. The last two lectures will focus on proof complexity for non-monotonic logics. These are particularly interesting as non-monotonic aspects are now recognised as being rather important in various areas of KR that have previously been based on purely monotonic reasoning, such as DL reasoning for the Semantic Web or the Live Sciences. We will describe proof systems for default logic, autoepistemic logic, and circumscription, and also explain their relations to classical proof systems.

    For more information, please visit the course website.

    Painless NLP Programming with UIMA

    Posted under: Course and Workshop Descriptions; Language and Computation.

    UIMA (Unstructured Information Management Architecture) is a modular and flexible framework which enables researchers to easily construct a software pipeline able to analyse large volumes of unstructured information (http://incubator.apache.org/uima/). This framework provides researchers with valuable tools to assemble the many stand-alone NLP applications in the field into a useful NLP pipeline. For example, UIMA makes it relatively easy to combine separate software applications for Sentence splitting, Tokenisation, POS tagging, Dependency parsing and Named-entity recognition into a usable software pipeline that provides input to an RDF Triplestore or a Search Engine Index. In addition, the modular structure of UIMA emphasises interchangeability of NLP software modules between research groups.
    This course is designed as a practical and highly interactive workshop in which participants are invited to write, over the course of one week, a UIMA-based Semantic Search application (Java) under the supervision of the organisers. If successful, this application could be made available on the ESSLLI website as a demo for Semantic Intranet Search. Participants will also be shown how to use UIMA for data mining in a real-world application (data mining from biomedical texts).
    Tentative Schedule.
    Day one: introduction to the UIMA framework and comparison with other frameworks (GATE, Nooj, NLTK) and NLP libraries (openNLP, Freeling, Tanl). The only day of the course without programming. The introduction will be given using slides and screenshots of the UIMA SDK.
    Day two: building a basic single UIMA Analysis Engine. Integration of this Analysis Engine in a basic NLP pipeline.
    Day three: integrating search analysis and text. Beyond the semantic search engine already provided with UIMA, use and explore other alternatives for the Semantic indexing and Storage modules (e.g. Lucene, MG4J), and final application (e.g. Web/REST Services or RDF CAS consumers).
    Day four: build a search application using the modules developed previously.
    Day five: real-world example: UIMA for data mining from biomedical text.

    Further particulars (e.g, prerequisites):
    Prerequisites: we will assume students to have a basic working knowledge of the Java programming language and be familiar with basic NLP tasks such as tokenisation, POS tagging, parsing, Named-Entity recognition etc.
    Infrastructure: since this course is intended as a hands-on, interactive course in which students will be involved in actual programming, it would be very useful to have at our disposal a seminar room with one computer per participant. Basic installation requirements would be SUN Java JRE, Eclipse SDK, Apache UIMA, internet connection.
    Relevance to ESSLLI Summer School. After this course, we want students interested in Language and Computation to be able to assemble their own NLP pipelines and apply them to their research.

    Course material and exercise code is available here: http://phis.ruc.dk/esslli2010uima.tbz

    For instructions on setting up your computer before the course commences, please refer to the installation instructions.

    Probabilistic Model Checking

    Posted under: Course and Workshop Descriptions; Logic and Computation.

    Probabilistic model checking is a formal verification technique for the analysis of systems that exhibit stochastic behaviour. Such behaviour occurs, for example, due to randomisation, commonly used as a symmetry breaker in distributed coordination, security and communication protocols. Stochastic modelling is also important in performability, dependability and fault-tolerance, and more recently in the analysis of biological processes. Probabilistic model checking enables a range of quantitative analyses of probabilistic models against specifications such as “the worst-case probability of intrusion within 10 seconds”, “the minimum expected power consumption over all possible schedulings”, or “the expected time until a protein degrades”. In recent years, increasing interest in the topic of probabilistic verification has led to significant advances in the applicability and efficiency of these techniques, as well as the discovery of interesting and anomalous behaviour in a wide range of real-life case studies.

    This course will give an overview of the area of probabilistic model checking, covering both the theoretical foundations as well as the practical aspects of the topic. The lectures will include four types of probabilistic models (all variants of Markov chains), specification notations (based on probabilistic temporal logics), and techniques available for their automatic verification. The course will also introduce PRISM (www.prismmodelchecker.org), a state-of-the-art probabilistic model checker, and illustrate several case studies that have been modelled and analysed in PRISM, such as the Bluetooth device discovery, Zeroconf link-local addressing, power management, probabilistic contract signing, and biological signalling pathways.

    FURTHER PARTICULARS
    Pre-requisites: Familiarity with automata and temporal logic will be helpful, but is not essential. No knowledge of probability theory will be assumed.

    Word Sense Disambiguation and Induction

    Posted under: Course and Workshop Descriptions; Language and Computation.

    Word Sense Disambiguation (WSD), the ability to identify the intended meanings of words (senses) in context, is a key problem in Natural Language Processing (NLP), potentially enabling deeper representations of text. WSD is performed with respect to an existing inventory of word senses. If such inventory is not available, or within application-driven scenarios, a sense  inventory can be automatically acquired from text corpora, a task  known as Word Sense Induction (WSI).

    This course will provide an introduction to Word Sense Disambiguation and Induction. The aim of the course is  two-fold: first, we introduce the audience to a wide range of techniques for the two tasks; in addition, we provide tools for the development of systems able to participate in past and current evaluation exercises for  WSD and WSI (Semeval-2007 and 2010).

    The course will be structured as follows.

    1) Introduction: WSD and WSI
    2) WSD: methods and issues
    3) WSI: methods and issues
    4) Evaluation measures and campaigns (Semeval-2007 and 2010)
    5) Lab: in-depth analysis of a sample system

    Part of the course will follow and extend material appearing in a recent survey article:

    R. Navigli. Word Sense Disambiguation: a Survey, ACM Computing Surveys, 41(2), ACM Press, 2009, pp. 1-69.
    http://www.dsi.uniroma1.it/~navigli/pubs/ACM_Survey_2009_Navigli.pdf

    Further particulars (e.g, prerequisites):

    This tutorial targets both computer scientists and computational linguists. The tutorial is self-contained, so no specific background knowledge is required. The objective is to give all attendees a clear understanding of a wide range of techniques for WSD and WSI.

    Computational Models of Text Quality

    Posted under: Course and Workshop Descriptions; Language and Computation.

    Many natural language processing applications (summarization, text generation, machine translation) are concerned with the production of text of high linguistic quality—grammatical, fluent text that the intended reader can easily understand. This has motivated the recent development of many computational models aimed at capturing aspects of text quality, usually focusing at one text quality factor at a time.

    In this course, we will overview a wide range of text quality factors: vocabulary-related, syntactic and discourse, including form of referring expressions and word, entity and topic flow. The factors will be introduced and compared in the context of specific applications such as information ordering: deciding in what order to present a set of selected sentences, clauses or predicates; determining grade level readability: deciding if a particular text is suitable for readers known to be in a given school grade; assessing sentence fluency for machine translation and text simplification; summarization.

    No current textbook or overview paper gives such systematic presentation of linguistic phenomena involved in determining text quality, the computational tools used to model these phenomena, and real applications in which the tools are incorporated. For this reason, researchers with varied interests can benefit from the course. (Computational) Linguists interested in text quality (readability, coherence, fluency) will benefit from this focused overview of the diverse recent work on various aspects of text quality and computationally minded people interested in system development will benefit from the exposure to linguistic insights and ideas that could be helpful in their work.

    A sample of papers on which the material of the course will be based includes: Karamanis et al, CL (March 2009), Elsner and Charniak, ACL-HLT (2008), Pitler and Nenkova, EMNLP (2008), Soricut and Marcu, ACL (2006), Barzialy and Lee, NAACL (2004).

    Further particulars (e.g, prerequisites): some background in basic computational formalisms used in natural language processing: probability, Markov chains/hidden Markov models, language models.

    Answering Queries in Description Logics: Theory and Applications to Data Management

    Posted under: Course and Workshop Descriptions; Logic and Computation.

    Description logics (DLs) provide the formal foundation for ontologies and for the standard ontology language OWL; various DLs can be put into correspondence with formalisms used for conceptual modeling in various contexts (e.g., the Entity-Relationship Model and UML Class Diagrams).  By virtue of such a correspondence DLs are very well suited to represent complex domain knowledge and to act as a conceptual layer on top of traditional information sources (e.g., relational databases).  The possibility to rely on such a conceptual layer is of importance in several application contexts that rely on huge amounts of data with complex interrelationships, e.g., in Data Integration, Data Exchange, the Semantic Web, Ontology-Based Data Access.  In these contexts, the fundamental inference task is querying the data with expressive database inspired query languages, while fully taking into account the semantics of the ontology.

    This setting poses new and challenging requirements w.r.t. efficiency of inference, which have recently led to the development of new families of DLs, such as the DL-Lite family (on which the standard OWL2-QL profile is based), the EL family, and the Horn-SHIQ family. For example, the DL-Lite family spans a broad-range of logics that, on the one hand, capture the typical constructs used in conceptual modeling formalisms, and, on the other hand, are restricted in their constructs so as to give rise to an optimal trade-off between expressive power and efficiency of reasoning over large knowledge-bases, specifically for querying large amounts of data.

    In light of this premise, the course will cover the following topics:

    1) Correspondence between DLs and data modeling formalisms, and discussion on how DLs can be adopted as conceptual layer to access data.

    2) Relationships and differences between querying in traditional databases (model checking) and querying in the presence of ontologies (reasoning), and challenges arising when accessing and querying large amounts of data through an ontology.

    3) Detailed survey of the DLs designed to provide high-level conceptual interface for querying databases and the corresponding complexity results and reasoning procedures.  Specifically, we will:
    - discuss a spectrum of such DLs (from the one corresponding to OWL2-QL to DL-Lite_bool, EL, and fragments of Horn-SHIQ);
    - concentrate on the problem of answering database-like queries, but also consider other reasoning tasks (ranging from standard DL reasoning, to forms of “metareasoning”);
    - cover various reasoning approaches and techniques.

    Further particulars (e.g, prerequisites):

    Prerequisites
    - Basic knowledge of the following topics, as taught at the BSc level of a computer science curriculum:
    - propositional and first-order logic,
    - databases (relational model and SQL),
    - theory of computation (Turing Machines, P, NP), although we will briefly overview the required notions in the course.
    - Knowledge of description logics is a plus but not required.  We will introduce all necessary notions about DLs in the course.

    Outcome:
    At the end of the course, the participants will:
    - have learned about a new application area of logic, viz., knowledge representation in data management systems;
    - have understood the relationships and differences between query answering in databases and query answering in the presence of ontologies;
    - be familiar with the state-of-the-art methods and techniques of query evaluation via a high level conceptual interface, the corresponding description logics and fragments of the web ontology language OWL.