Accepted Papers

The papers selected are displayed below, they are separated in long presentations and short presentations.

Regular Presentations

- Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria, Fernando A. Tohmé, Gustavo A. Bodanza, and Guillermo R. Simari
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics based on Unfounded Sets, Martin Gebser, Torsten Schaub, Hans Tompits, and Stefan Woltran

- An Alternative Foundation for DeLP: Defeating Relations and Truth Values, Ignacio D. Viglizzo, Fernando A. Tohmé, and Guillermo R. Simari 
- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes, Joachim Biskup and Sebastian Link 
- Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory, Henning Koehler 
- Cost-minimising Strategies for Data Labelling: Optimal Stopping and Active Learning, Christos Dimitrakakis and Christian Savu-Krohn 
- Information-Optimal Reflections of View Updates on Relational Database Schemata, Stephen J. Hegner 
- Merging First-Order Knowledge using Dilation Operators, Nikos Gorogiannis and Anthony Hunter
- On the Existence of Armstrong Instances with Bounded Domains, Attila Sali and László Székely 
- Reasoning on Data Models in Schema Translation, Paolo Atzeni, Giorgio Gianforme, and Paolo Cappellari 
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings, Andrea Calì, Thomas Lukasiewicz, Livia Predoiu, and Heiner Stuckenschmidt 
- Using Transversals for Discovering XML Functional Dependencies, Thu Trinh 
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML, Alex Thomo, S. Venkatesh, and Ying Ying Ye

Short Presentations

- A Probabilistic Logic with Polynomial Weight Formulas, Aleksandar Perovi, Zoran Ognjanovi, Miodrag Raskovi, and Zoran Markovi 
- A Transformation-based Approach to View Updating in Stratifiable Deductive Databases, Andreas Behrend and Rainer Manthey 
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach, Vasiliki Efstathiou and Anthony Hunter 
- Database Preference Queries - A Possibilistic Logic Approach with Symbolic Priorities, Allel Hadjali, Souhila Kaci, and Henri Prade 
- Defeasible Reasoning and Partial Order Planning, Diego R. García, Alejandro J García, and Guillermo R. Simari 
- Lossless Decompositions in Complex-Valued Databases, Henning Koehler and Sebastian Link 
- SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach, Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, and Zied Elouedi 
- Towards a Logic for Abstract MetaFinite State Machines, Qing Wang and Klaus-Dieter Schewe 
- Towards a Fuzzy Logic for Automated Multi-issue Negotiation, Azzurra Ragone, Umberto Straccia, Tommaso Di Noia, Eugenio Di Sciascio, and Francesco M. Donini