JELIA 2012 Accepted Papers

The following regular papers and system descriptions have been accepted for presentation at JELIA 2012.

Regular Papers

• Sarah Holbrook and Pavel Naumov: Fault Tolerance in Belief Formation Networks
• Antoun Yaacoub and Philippe Balbiani: Deciding bisimulation in Datalog
• Luciano Caroprese, Mirek Truszczynski, Irina Trubitsyna and Ester Zumpano: The View-Update Problem for Indefinite Databases
• 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
• François Schwarzentruber, Srdjan Vesic and Tjitze Rienstra: Building an Epistemic Logic for Argumentation
• Abdallah Saffidine: Minimal Proof Search for Modal Logic K Model Checking
• Richard Stocker, Louise Dennis, Michael Fisher and Clare Dixon: Verification of Brahms Human-Robot Teamwork Models
• Nitin Yadav and Sebastian Sardina: Reasoning about BDI Agent Programs using ATL-like Logics
• Davide Ciucci and Didier Dubois: Three-valued logics for incomplete information and epistemic logic
• Karsten Lehmann and Anni-Yasmin Turhan: A Framework for Semantic-based Similarity Measures for ELH-Concepts
• Anna Zamansky: A Preferential Framework for Trivialization-Prone Reasoning with Inconsistent Information
• Laurent Perrussel, Jerusa Marchi, Jean-Marc Thévenin and Dongmo Zhang: Relevant Minimal Change in Belief Update
• Naoya Inoue and Kentaro Inui: Large-scale Cost-based Abduction in Full-fledged First-order Predicate Logic with Cutting Plane Inference
• Thomas Eiter, Thomas Krennwallner and Harald Beck: Inconsistency Management for TrafficRegulations: Formalization and Complexity Results
• Guillaume Aucher, Bastien Maubert and François Schwarzentruber: Generalized DEL-sequents
• Regis Alenda, Nicola Olivetti and Gian Luca Pozzato: Nested Sequent Calculi for Conditional Logics
• Nitin Yadav and Sebastian Sardina: Qualitative Approximate Behavior Composition
• Marc Finthammer and Christoph Beierle: How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic
• Patrick Krümpelmann and Gabriele Kern-Isberner: Belief Base Change Operations for Answer Set Programming
• Richard Booth, Thomas Meyer and Ivan Varzinczak: PTL: A Propositional Typicality Logic
• Joanna Golinska-Pilarek: On decidability of a logic for order of magnitude qualitative reasoning with bidirectional negligibility
• Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Gian Luca Pozzato: A minimal model semantics for nonmonotonic reasoning
• Nicolas Troquard and Dirk Walther: On satisfiability in ATL with strategy contexts
• Lluis Godo, Enrico Marchioni and Pere Pardo: Extending a temporal defeasible argumentation framework with possibilistic weights
• Laura Bozzelli, Hans van Ditmarsch and Sophie Pinchinat: The complexity of one-agent Refinement Modal Logic
• Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl and Peter Schüller: Exploiting Unfounded Sets for HEX-Program Evaluation
  Bjoern Lellmann and Dirk Pattinson. Sequent Systems for Lewis' Conditional Logics
• Dimitris Askounis, Costas Koutras and Yorgos Zikos: Knowledge means `all', Belief means `most'.
• Alfredo Gabaldon: A Selective Semantics for Logic Programs with Preferences
• Regis Alenda and Nicola Olivetti: Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models
• Martin Slota and Joao Leite: A Unifying Perspective on Knowledge Updates
• Mikkel Birkegaard Andersen, Thomas Bolander and Martin Holm Jensen: Conditional Epistemic Planning
• Masood Feyzbakhsh Rankooh, Ali Mahjoob and Gholamreza Ghassem-Sani: Using Satisfiability for Non-Optimal Temporal Planning
• Enrico Franconi, Volha Kerhet and Nhung Ngo: Exact Query Reformulation with first-order Ontologies and Databases
• Bart Verheij. Jumping to Conclusions: A Logico-Probabilistic Foundation for Defeasible Rule-Based Arguments

System Descriptions

• Dmitry Tishkovsky, Renate A: Schmidt and Mohammad Khodadadi. The Tableau Prover Generator MetTeL2
• Julien Balax, Florence Dupin De Saint Cyr and David Villard. DebateWEL: An interface for Debating With Enthymemes and Logical formulas
• Matthias Nickles: A System for the Use of Answer Set Programming in Reinforcement Learning
• 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