JELIA 2012 PROGRAM

WEDNESDAY

09h30-10h30

Wiebe van der Hoek. On Two Results in Contemporary Modal Logic: Local Definability and Succinctness (invited talk)

Chair: Luis Fariñas del Cerro

 

11h00-12h30
Description logics and databases (auditorium)

• Enrico Franconi, Volha Kerhet and Nhung Ngo. Exact Query Reformulation with first-order Ontologies and Databases
• Karsten Lehmann and Anni-Yasmin Turhan. A Framework for Semantic-based Similarity Measures for ELH-Concepts
• Antoun Yaacoub and Philippe Balbiani. Deciding bisimulation in Datalog
  

Chair: Dirk Walther

 

Knowledge and Actions (salle des thèses)

• Guillaume Aucher, Bastien Maubert and François Schwarzentruber. Generalized DEL-sequents
• Mikkel Birkegaard Andersen, Thomas Bolander and Martin Holm Jensen. Conditional Epistemic Planning

Chair: Florence Dupin-de St.Cyr - Bannay

 

14h15-16h00

System Descriptions (room 001)

• Julien Balax, Florence Dupin De Saint-Cyr and David Villard. DebateWEL: An interface for Debating With Enthymemes and Logical formulas
• Minh Dao-Tran, Thomas Eiter, Michael Fink, Gerald Weidinger and Antonius Weinzierl. OMiGA: An Open Minded Grounding on-the-fly Answer-Set Solver
• Marco Maratea, Luca Pulina and Francesco Ricca. The Multi-Engine ASP Solver ME-ASP
• Matthias Nickles. A System for the Use of Answer Set Programming in Reinforcement Learning
• Dmitry Tishkovsky, Renate A. Schmidt and Mohammad Khodadadi. The Tableau Prover Generator MetTeL2

Chair: Jérôme Mengin

 

16h30-17h30
Update and revision (auditorium)

• Patrick Krümpelmann and Gabriele Kern-Isberner. Belief Base Change Operations for Answer Set Programming
• Laurent Perrussel, Jerusa Marchi, Jean-Marc Thévenin and Dongmo Zhang. Relevant Minimal Change in Belief Update

Chair: Didier Dubois

 

Proof theory of conditional logics (salle des thèses)

• Bjoern Lellmann and Dirk Pattinson. Sequent Systems for Lewis' Conditional Logics
• Regis Alenda, Nicola Olivetti and Gian Luca Pozzato. Nested Sequent Calculi for Conditional Logics

Chair: Sergei P. Odintsov

 

---

THURSDAY

09h00-10h00

Ulrich Furbach. Extensions of Hyper Tableaux (invited talk)

Chair: Andreas Herzig

 

10h30-12h30
Logic Programming, ASP (auditorium)

• Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Gian Luca Pozzato. A Minimal Model Semantics for Nonmonotonic Reasoning
• Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl and Peter Schüller. Exploiting Unfounded Sets for HEX-Program Evaluation
• Alfredo Gabaldon. A Selective Semantics for Logic Programs with Preferences
• Thomas Eiter, Thomas Krennwallner and Harald Beck. Inconsistency Management for Traffic Regulations: Formalization and Complexity Results

Chair: José Alferes

 

Uncertainty, inconsistency (salle des thèses)

• Davide Ciucci and Didier Dubois. Three-valued Logics for Incomplete Information and Epistemic Logic
• Marc Finthammer and Christoph Beierle. How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic
• Anna Zamansky. A Preferential Framework for Trivialization-Prone Reasoning with Inconsistent Information
• Sarah Holbrook and Pavel Naumov. Fault Tolerance in Belief Formation Networks

Chair: Philippe Besnard

 

14h15-16h15
Argumentation (auditorium)

• Bart Verheij. Jumping to Conclusions. A Logico-Probabilistic Foundation for Defeasible Rule-Based Arguments
• Srdjan Vesic and Leendert van der Torre. A New Class of Classical Logic Instantiations of Dung's Abstract Argumentation Theory
• Ofer Arieli. Conflict-Tolerant Semantics for Argumentation Frameworks
• Lluis Godo, Enrico Marchioni and Pere Pardo. Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights
  

Chair: François Schwarzentruber

 

Automated reasoning, planning (salle des thèses)

• Nitin Yadav and Sebastian Sardina. Qualitative Approximate Behavior Composition
• Richard Stocker, Louise Dennis, Michael Fisher and Clare Dixon. Verification of Brahms Human-Robot Teamwork Models
• Abdallah Saffidine. Minimal Proof Search for Modal Logic K Model Checking
• Masood Feyzbakhsh Rankooh, Ali Mahjoob and Gholamreza Ghassem-Sani. Using Satisfiability for Non-Optimal Temporal Planning

Chair: Nicola Olivetti

 

17h45: Guided tour of the city

We will take a guided tour of the main ancient buildings of the city of Toulouse. The tour will last around 90 minutes, and will finish at the restaurant for the gala dinner. We will start from the “Donjon”, the ancient square tower on “Square Charles de Gaulle”; this is where the métro station “Capitole” is located. Meeting point is in front of the entrance to the Tourist Office, located in the Donjon (If coming from the Place du Capitole, it is on the other side of the Town Hall, just walk under the porch through the inner yard of the Town Hall.).

19h30: Gala dinner at the Brasserie Les Beaux-Arts

1 quai de la Daurade - 31000 Toulouse - Tél : +33 (0)5 61 21 12 12
www.brasserielesbeauxarts.com
We will meet at the restaurant at 19h30.

---

FRIDAY

09h00-10h30
Knowledge, belief and action (auditorium)

• Nitin Yadav and Sebastian Sardina. Reasoning about BDI Agent Programs using ATL-like Logics
• Dimitris Askounis, Costas Koutras and Yorgos Zikos. Knowledge Means `all', Belief Means `most'
• François Schwarzentruber, Srdjan Vesic and Tjitze Rienstra. Building an Epistemic Logic for Argumentation

Chair: Ivan Varzinczak

 

Nonmonotonic Reasoning, Abduction (salle des thèses)

• Martin Slota and Joao Leite. A Unifying Perspective on Knowledge Updates
• Luciano Caroprese, Mirek Truszczynski, Irina Trubitsyna and Ester Zumpano. The View-Update Problem for Indefinite Databases

Chair: Agustin Valverde

 

11h00-12h30
Nonmonotonic Reasoning, Abduction (auditorium)

• Richard Booth, Thomas Meyer and Ivan Varzinczak. PTL: A Propositional Typicality Logic
• Naoya Inoue and Kentaro Inui. Large-scale Cost-based Abduction in Full-fledged First-order Predicate Logic with Cutting Plane Inference
• Regis Alenda and Nicola Olivetti. Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models

Chair: Jonathan Ben-naim

 

Decidability and complexity (salle des thèses)

• Nicolas Troquard and Dirk Walther. On Satisfiability in ATL with Strategy Contexts
• Joanna Golinska-Pilarek. On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility
• Laura Bozzelli, Hans van Ditmarsch and Sophie Pinchinat. The Complexity of One-Agent Refinement Modal Logic

Chair: Philippe Balbiani

 

14h15-15h15

Leila Amgoud and Philippe Besnard. Logical Limits of Dung's Abstract Argumentation Framework (invited talk)

Chair: Leon van der Torre