TUESDAY 23
19:00 - 21:00 Reception
Madeira de Honra (Conference Venue)
WEDNESDAY 24
08:00 - 08:45 Registration
08:45 - 09:00 Welcome address
09:00 - 10:00 Invited Talk
Query Answering over Description Logic Ontologies
Diego Calvanese
10:00 - 10:30 Coffee Break
10:30 - 12:30 Session 1A - Description Logics
The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics
Stefan Borgwardt, José A. Leyva Galano and Rafael Peñaloza
Tight Complexity Bounds for Reasoning in the Description Logic BEL
Ismail Ilkan Ceylan and Rafael Peñaloza
Relevant Closure: A New Form of Defeasible Reasoning for Description Logics
Giovanni Casini, Thomas Meyer, Kody Moodley and Riku Nortje
Error-Tolerant Reasoning in the Description Logic EL
Michel Ludwig and Rafael Peñaloza
10:30 - 12:30 Session 1B - Automated Reasoning
Sub-Propositional Fragments of the Interval Temporal Logic of Allen's Relations
Davide Bresolin, Emilio Muñoz-Velasco and Guido Sciavicco
SAT modulo Graphs: Acyclicity
Martin Gebser, Tomi Janhunen and Jussi Rintanen
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form
Said Jabbour, Joao Marques-Silva, Lakhdar Sais and Yakoub Salhi
Improving the Normalization of Weight Rules in Answer Set Programs
Jori Bomanson, Martin Gebser and Tomi Janhunen
12:30 - 14:00 Lunch
14:00 - 16:00 Session 2A - Short Papers
Probabilistic Abstract Dialectical Frameworks
Sylwia Polberg and Dragan Doder
Argumentative Aggregation of Individual Opinions
Cosmina Croitoru
Measuring similarity between sets of formulas in judgment aggregation
Marija Slavkovik and Thomas Ågotnes
Exploiting Answer Set Programming for Handling Information Diffusion in a Multi-Social-Network Scenario
Giuseppe Marra, Francesco Ricca, Giorgio Terracina and Domenico Ursino
Reasoning about Dynamic Normative Systems
Max Knobbout, Mehdi Dastani and John-Jules Meyer
A Modal Logic of Knowledge, Belief, and Estimation
Costas Koutras, Christos Moyzes and Yorgos Zikos
A Logic for Belief Contraction
Konstantinos Georgatos
Logic foundations of the OCL modelling language
Enrico Franconi, Alessandro Mosca, Xavier Oriol, Guillem Rull and Ernest Teniente
Constraint-Based Algorithm for Computing Temporal Invariants
Jussi Rintanen
Answer Set Solver Backdoors
Emilia Oikarinen and Matti Järvisalo
Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara and Naoyuki Tamura
Revisiting reductants in the Multi-adjoint Logic Programming framework
Pascual Julián-Iranzo, Jesús Medina Moreno and Manuel Ojeda Aciego
14:00 - 15:30 Session 2B1 - System Descriptions
System ASPMT2SMT: Computing ASPMT Theories by SMT Solvers
Michael Bartholomew and Joohyung Lee
A Library of Anti-Unification Algorithms (talk cancelled)
Alexander Baumgartner and Temur Kutsia
The D-FLAT System for Dynamic Programming on Tree Decompositions
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran
15:30 - 16:00 Session 2B2 - Short System Descriptions
ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance
María Alpuente, Santiago Escobar, Javier Espert and José Meseguer
Drawing Euler diagrams from region connection calculus specifications with local search
Françcois Schwarzentruber and Jin-Kao Hao
16:00 - 17:00 Poster Session + Coffee Break
THURSDAY 25
09:00 - 10:00 Invited Talk
Tools for the investigation of substructural and paraconsistent logics
Agata Ciabattoni
10:00 - 10:30 Coffee Break
10:30 - 12:30 Session 3A - Logics for Uncertain Reasoning
Logical Foundations of Possibilistic Keys
Henning Koehler, Uwe Leck, Sebastian Link and Henri Prade
Possibilistic Boolean Games: Strategic Reasoning under Incomplete Information
Sofie De Clercq, Steven Schockaert, Martine De Cock and Ann Nowé
LEG networks for ranking functions
Christian Eichhorn and Gabriele Kern-Isberner
Logics for Approximating Implication Problems of Saturated Conditional Independence
Henning Koehler and Sebastian Link
10:30 - 12:30 Session 3B - Non-Classical Logics
Finitary S5-Theories
Tran Cao Son, Enrico Pontelli, Chitta Baral and Gregory Gelfond
Efficient program transformers for translating LCC to PDL
Pere Pardo, Enrique Sarrión-Morillo, Fernando Soler-Toscano and Fernando R. Velázquez-Quesada
On the expressiveness of the interval logic of Allen's relations over finite and discrete linear orders
Luca Aceto, Dario Della Monica, Anna Ingolfsdottir, Angelo Montanari and Guido Sciavicco
Only-Knowing à la Halpern-Moses for non-omniscient rational agents: a preliminary report
Dimitris Askounis, Costas Koutras, Christos Moyzes and Yorgos Zikos
12:30 - 14:00 Lunch
14:30 - 18:30 Excursion
19:30 - ... Social Dinner
Friday 26
09:00 - 10:00 Invited Talk
A simple logic for reasoning about actions, update, revision, argumentation, planning, and all that
Andreas Herzig
(The talk by Hector Geffner, initially scheduled, had to be cancelled due to the cancellation of connecting flights.)
10:00 - 10:30 Coffee Break
10:30 - 12:30 Session 4A - Answer-Set Programming
A complexity assessment for queries involving sufficient and necessary causes
Pedro Cabalar, Jorge Fandiño and Michael Fink
Inductive Learning of Answer Set Programs
Mark Law, Alessandra Russo and Krysia Broda
Stable Models of Fuzzy Propositional Formulas
Joohyung Lee and Yi Wang
A Free Logic for Stable Models with Partial Intensional Functions
Pedro Cabalar, Luis Farinas Del Cerro, David Pearce and Agustin Valverde
10:30 - 12:30 Session 4B - Belief Revision
Constructive Models for Contraction with Intransitive Plausibility Indifference
Pavlos Peppas and Mary-Anne Williams
Four floors for the theory of theory change: The case of imperfect discrimination
Hans Rott
Revisiting Postulates for Inconsistency Measures
Philippe Besnard
A Translation-based Approach for Revision of Argumentation Frameworks
Sylvie Coste-Marquis, Sébastien Konieczny, Jean-Guy Mailly and Pierre Marquis
12:30 - 14:00 Lunch
14:00 - 16:00 Session 5A - Dealing with Inconsistency in ASP and DL
Preserving Strong Equivalence while Forgetting
Matthias Knorr and Jose Julio Alferes
Computing Repairs for Inconsistent DL-programs over EL ontologies
Thomas Eiter, Michael Fink and Daria Stepanova
A prioritized assertional-based revision for DL-Lite knowledge bases
Zied Bouraoui, Salem Benferhat, Odile Papini and Eric Würbel
Modular Paracoherent Answer Sets
Giovanni Amendola, Thomas Eiter and Nicola Leone
14:00 - 16:00 Session 5B - Reason about Actions and Causality
Action Theories over Generalized Databases with Equality Constraints
Fabio Patrizi and Stavros Vassos
A dynamic view of active integrity constraints
Guillaume Feuillade and Andreas Herzig
Similarity Orders from Causal Equations
Johannes Marti and Riccardo Pinosio
Verification of Context-Sensitive Knowledge and Action Bases
Diego Calvanese, Ismail Ilkan Ceylan, Marco Montali and Ario Santoso
16:00 - 16:30 Coffee Break
16:30 - 17:30 Invited Talk
Towards Argument-based Persuasion Technologies
Anthony Hunter
Technical Program
