| 09:00 - 10:00 |
Invited Talk |
Egon Börger and Don Batory |
Coupling Design and Verification in Software Product Lines |
| 10:00 - 10:30 |
Morning Tea Break |
| 10:30 - 12:00 |
Regular Presentation |
Martin Gebser, Torsten Schaub, Hans Tompits, and Stefan
Woltran |
Alternative Characterizations for Program Equivalence under
Answer-Set Semantics based on Unfounded Sets |
| Short Presentation |
Allel Hadjali, Souhila Kaci, and Henri Prade |
Database Preference Queries - A Possibilistic Logic Approach with
Symbolic Priorities |
| 12:00 - 14:00 |
Lunch Break |
| 14:00 - 15:30 |
Regular Presentation |
Stephen J. Hegner |
Information-Optimal Reflections of View Updates on Relational
Database Schemata |
| Short Presentation |
Andreas Behrend and Rainer Manthey |
A Transformation-based Approach to View Updating in Stratifiable
Deductive Databases |
| 15:30 - 16:00 |
Afternoon Tea Break |
| 16:00 - 18:00 |
Regular Presentation |
Nikos Gorogiannis and Anthony Hunter |
Merging First-Order Knowledge using Dilation Operators |
| Regular Presentation |
Ignacio D. Viglizzo, Fernando A. Tohmé, and Guillermo R.
Simari |
An Alternative Foundation for DeLP: Defeating Relations and Truth
Values |
| 09:00 - 10:00 |
Invited Talk |
Gyula O.H. Katona |
Random Geometric Identification |
| 10:00 - 10:30 |
Morning Tea Break |
| 10:30 - 12:00 |
Regular Presentation |
Thu Trinh |
Using Transversals for Discovering XML Functional Dependencies |
| Short Presentation |
Henning Koehler and Sebastian Link |
Lossless Decompositions in Complex-Valued Databases |
| 12:00 - 14:00 |
Lunch Break |
| 14:00 - 15:30 |
Regular Presentation |
Andrea Calì, Thomas Lukasiewicz, Livia Predoiu, and Heiner
Stuckenschmidt |
Tightly Integrated Probabilistic Description Logic Programs for
Representing Ontology Mappings |
| Short Presentation |
Aleksandar Perovic, Zoran Ognjanovic, Miodrag Raskovic, and Zoran
Markovic |
A Probabilistic Logic with Polynomial Weight Formulas |
| 15:30 - 16:00 |
Afternoon Tea Break |
| 16:00 - 18:00 |
Regular Presentation |
Attila Sali and László Székely |
On the Existence of Armstrong Instances with Bounded Domains |
| Regular Presentation |
Alex Thomo, S. Venkatesh, and Ying Ying Ye |
Visibly Pushdown Transducers for Approximate Validation of
Streaming XML |
| 09:00 - 10:00 |
Regular Presentation |
Joachim Biskup and Sebastian Link |
Appropriate Reasoning about Data Dependencies in Fixed and
Undetermined Universes |
| 10:00 - 10:30 |
Morning Tea Break |
| 10:30 - 12:00 |
Regular Presentation |
Paolo Atzeni, Giorgio Gianforme, and Paolo Cappellari |
Reasoning on Data Models in Schema Translation |
| Short Presentation |
Qing Wang and Klaus-Dieter Schewe |
Towards a Logic for Abstract MetaFinite State Machines |
| from 12:00 |
Lunch Excursion, Dinner |
| 09:00 - 10:00 |
Invited Talk |
Jürgen Dix |
Strategic Abilities of Agents |
| 10:00 - 10:30 |
Morning Tea Break |
| 10:30 - 12:00 |
Regular Presentation |
Henning Koehler |
Autonomous Sets - A Method for Hypergraph Decomposition with
Applications in Database Theory |
| Short Presentation |
Vasiliki Efstathiou and Anthony Hunter |
Algorithms for Effective Argumentation in Classical Propositional
Logic: A Connection Graph Approach |
| 12:00 - 14:00 |
Lunch Break |
| 14:00 - 15:30 |
Regular Presentation |
Christos Dimitrakakis and Christian Savu-Krohn |
Cost-minimising Strategies for Data Labelling: Optimal Stopping
and Active Learning |
| Short Presentation |
Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, and Zied
Elouedi |
SIM-PDT: A Similarity Based Possibilistic Decision Tree
Approach |
| 15:30 - 16:00 |
Afternoon Tea Break |
| 16:00 - 18:00 |
Regular Presentation |
Fernando A. Tohmé, Gustavo A. Bodanza, and Guillermo R.
Simari |
Aggregation of Attack Relations: A Social-Choice Theoretical
Analysis of Defeasibility Criteria |
| Short Presentation |
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia, Eugenio Di
Sciascio, and Francesco M. Donini |
Towards a Fuzzy Logic for Automated Multi-issue Negotiation |
| Short Presentation |
Diego R. García, Alejandro J García, and Guillermo
R. Simari |
Defeasible Reasoning and Partial Order Planning |