W3C home > Mailing lists > Public > public-xg-urw3@w3.org > December 2011

FoIKS 2012: Call for Participation

From: Thomas Lukasiewicz <lukasiew@gmail.com>
Date: Thu, 15 Dec 2011 19:25:00 +0000
Message-ID: <4EEA498C.4030802@cs.ox.ac.uk>
To: public-xg-urw3@w3.org
[Apologies for multiple copies]


            -------------------------------------------------------
              C A L L   F O R   P A R T I C I P A T I O N
            -------------------------------------------------------

                      Seventh International Symposium

                                    on

             Foundations of Information and Knowledge Systems

                               (FoIKS 2012)

                     March 5-9, 2012 -- Kiel, Germany

                          http://2012.foiks.org/


The FoIKS symposia provide a biennial forum for presenting and discussing
theoretical and applied research on information and knowledge systems. The
goal is to bring together researchers with an interest in this subject,
share research experiences, promote collaboration and identify new issues
and directions for future research.

FoIKS 2012 solicits original contributions dealing with any foundational
aspect of information and knowledge systems. This includes submissions that
apply ideas, theories or methods from specific disciplines to information
and knowledge systems. Examples of such disciplines are discrete mathematics,
logic and algebra, model theory, information theory, complexity theory,
algorithmics and computation, statistics and optimisation.

Previous FoIKS symposia were held in Sofia (Bulgaria) in 2010, Pisa (Italy) in
2008, Budapest (Hungary) in 2006, Vienna (Austria) in 2004, Schloss Salzau near
Kiel (Germany) in 2002, and Burg/Spreewald near Berlin (Germany) in 2000 (see
http://www.foiks.org/). FoIKS took up the tradition of the conference series
Mathematical Fundamentals of Database Systems (MFDBS), which initiated East-West
collaboration in the field of database theory. Former MFDBS conferences were
held in Rostock (Germany) in 1991, Visegrad (Hungary) in 1989, and Dresden
(Germany) in 1987.

The FoIKS symposia are a forum for intense discussions. Speakers will be given
sufficient time to present their ideas and results within the larger context of
their research. Furthermore, participants will be asked to prepare a first
response to another contribution in order to initiate discussion.


WHY TO ATTEND:

   (1) high level research on database theory and artificial intelligence
       with world-class theoretical and applied research published by Springer
       in the LNCS series (since the beginning);
   (2) keynotes by leaders in the area of information systems theory and
       knowledge bases;
   (3) long talks (60 min) with reponders (15 min) and discussion (another
       15 min) each paper giving in the first 30 minutes an introduction into
       the area making thus each paper understandable by everybody in the
       auditory with a long break for continuing discussions;
   (4) for an introduction into the area, for your own continuing and advanced
       academic education and professional development tapping into new fields
       of research;
   (5) for your PhD students as a kind of special winter school as a quick,
       deep and high-level survey of the latest state-of-the-art in the area
       thus fostering the next generation of researchers by including them in
       the research dialogue and providing a deep background knowledge;
   (6) long and intensive discussion on each research  in a friendly and open
       climate promoting a culture of communication, exchange and collaborative
       work;
   (7) quick introduction into the essentials of each paper directly at the
       beginning of the conference.

Thus: a conference combining classical conference, tutorials and winter school
       having a real workshop atmosphere aiming at inspiration of your research
       and at collaboration with colleagues.


REGISTRATION:

https://www.is.informatik.uni-kiel.de/events/foiks_2012/index.php

Early-bird registration deadline: December 30, 2011.
Early-bird registration fee (for participants from academic organizations): EUR 500


INVITED SPEAKERS

András Benczúr (Computer and Automation Institute, Hungarian Academy of Sciences, Hungary)
Thomas Eiter (Vienna University of Technology, Austria)
Thomas Schwentick (TU Dortmund, Germany)


PROGRAM CHAIRS

Thomas Lukasiewicz (University of Oxford, UK)
Attila Sali (Alfréd Rényi Institute, Hungarian Academy of Sciences, Hungary)


LOCAL ORGANIZATION CHAIR

Bernhard Thalheim (Christian-Albrechts-University Kiel, Germany)


PUBLICITY CHAIR

Markus Kirchberg (HP Labs, Singapore)


ACCEPTED PAPERS:

* Functional Dependencies on Extended Relations Defined by Regular Languages
   Gyula I. Szabó and András Benczúr

* Inconsistency Tolerance in Knowledge-Based Systems by Dissimilarities
   Ofer Arieli and Anna Zamansky

* Revising Belief without Revealing Secrets
   Joachim Biskup and Cornelia Tadros

* Using Functional Dependencies for Reducing the Size of a Data Cube
   Eve Garnaud, Sofian Maabout, and Mohamed Mosbah

* Synchronous Parallel Database Transformations
   Klaus-Dieter Schewe and Qing Wang

* Armstrong Databases and Reasoning for Functional Dependencies and Cardinality Constraints over Partial Bags
   Sven Hartmann, Henning Koehler, Sebastian Link, and Bernhard Thalheim

* FD Covers and Universal Complements of Simple Projections
   Stephen Hegner

* Flexible and Efficient Distributed Resolution of Large Entities
   Csaba István Sidló, András J. Molnár, and Andras A. Benczúr

* Encoding Databases Satisfying a Given Set of Dependencies
   Gyula O.H. Katona and Krisztián Tichler

* The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs
   George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van Den Bussche, Dirk Van Gucht, Stijn Vansummeren, and Yuqing Wu

* On Lifted Inference for a Relational Probabilistic Conditional Logic with Maximum Entropy Semantics
   Annika Krämer and Christoph Beierle

* On Real-Valued Evaluation of Propositional Formulas
   Aleksandar Perovic, Dragan Doder, and Zoran Ognjanovic

* Detecting Suspect Answers in the Presence of Inconsistent Information
   Olivier Pivert and Henri Prade

* Backing and Undercutting in Abstract Argumentation Frameworks
   Andrea Cohen, Alejandro J. García, and Guillermo R. Simari.

* Handling Preferences in P2P Systems
   Luciano Caroprese and Ester Zumpano

* Formalizing Production Systems with Rule-Based Ontolgies
   Martin Rezk and Michael Kifer

* More than the Sum of its Parts - Holistic Ontology Alignment by Population-Based Optimisation
   Jürgen Bock, Sebastian Rudolph, and Michael Mutter

* Verifying Resource Requirements for Ontology-Driven Rule-Based Agents
   Abdur Rakib, Rokan Uddin Faruqui, and Wendy Maccaull

* Learning the News in Social Networks
   Krishnan Rajagopalan, Venkatesh Srinivasan, and Alex Thomo

* Count Constraints and the Inverse OLAP Problem: Definition, Complexity and a Step toward Aggregate Data Exchange
   Domenico Saccŕ, Edoardo Serra, and Antonella Guzzo


ORGANIZED BY:

Christian-Albrechts-University at Kiel, Germany

Completely non-profit organisation with full service for your fees.
Following the approach and tradition of the MFDBS (Mathematical fundamentals
of database systems) founded as the East European Forum for Database Theory
thus making the event the tenth event in this area.

For visa support please contact Ove Sörensen <ove@is.informatik.uni-kiel.de>


FURTHER INFORMATION

For further information, refer to the FoIKS 2012 web site at:

http://2012.foiks.org/
Received on Thursday, 15 December 2011 19:25:42 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Thursday, 15 December 2011 19:25:42 GMT