BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:3b9d3e53-b21a-4a12-a51c-ad258b6b9d7f
X-WR-CALNAME:[M2F] Balder ten Cate (University of Amsterdam)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20241027T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:3b9d3e53-b21a-4a12-a51c-ad258b6b9d7f
DTSTAMP:20260920T032001Z
CLASS:PUBLIC
DESCRIPTION:** Data examples for conjunctive queries **\n\nData examples ca
 n be a useful tool when a formal specification must be synthesized or comm
 unicated.  They sometimes provide a more convenient medium for communicati
 on than the formal specification itself. We all know this from daily life:
  think about teaching someone a card game. Simply reading out loud the rul
 es of the game is not an effective way of doing this. Instead\, what works
  best in practice is to give examples of valid and invalid game plays. In 
 data management\, data examples have been proposed and used in the context
  of the interactive design of schema mappings\, as well as query synthesis
 \, and query refinement and debugging. In knowledge representation\, data 
 examples arise\, for instance\, in the context of algorithms for learning 
 concept expressions and ontologies. The talk will be about data examples f
 or conjunctive queries\, and we will cover some fundamental questions\, su
 ch as: (a) when can a given query be uniquely characterized by a small num
 ber of data examples (where a data example is a database instance satisfyi
 ng given integrity constraints)\, and (b) how to construct\, from a given 
 set of data examples\, a 'good' fitting query (for various notions of good
 ness). To answer these questions\, we draw on\, and refine\, techniques fr
 om the literature on combinatorial graph theory and constraint satisfactio
 n problems.
DTSTART;TZID=Europe/Paris:20230221T140000
DTEND;TZID=Europe/Paris:20230221T150000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[M2F] Balder ten Cate (University of Amsterdam)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR