JELIA 2010
12th European Conference on Logics in Artificial Intelligence

September 13-15, 2010         Helsinki, Finland

JELIA 2010 Accepted Papers

Out of 91 submitted manuscripts (78 regular papers and 13 system descriptions), the following 26 regular papers and 5 system descriptions are accepted for presentation at JELIA 2010, making the JELIA 2010 regular paper acceptance ratio 33%.

Regular Papers

  • Ofer Arieli and Anna Zamansky: Similarity-Based Inconsistency-Tolerant Logics
  • Seif El-Din Bairakdar, Minh Dao-Tran, Thomas Eiter, Michael Fink, and Thomas Krennwallner: Decomposition of Distributed Nonmonotonic Multi-Context Systems
  • Salem Benferhat, Sylvain Lagrue, and Safa Yahi: Bridging Possibilistic Conditional Knowledge Bases and Partially Ordered Bases
  • Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, and Guido Fiorino: A Decidable Constructive Description Logic
  • Pedro Cabalar: A Normal Form for Linear Temporal Equilibrium Logic
  • Giovanni Casini and Umberto Straccia: Rational Closure for Defeasible Description Logics
  • Angelos Charalambidis, Konstantinos Handjopoulos, Panos Rondogiannis, and William Wadge: Extensional Higher-Order Logic Programming
  • Yin Chen, Hai Wan, Yan Zhang, and Yi Zhou: dl2asp: Implementing Default Logic via Answer Set Programming
  • Nadia Creignou, Johannes Schmidt, Michael Thomas, and Stefan Woltran: Sets of Boolean Connectives That Make Argumentation Easier
  • Flávio Cruz and Ricardo Rocha: Retroactive Subsumption-Based Tabled Evaluation of Logic Programs
  • Thomas Eiter, Michael Fink, and Antonius Weinzierl: Preference-Based Inconsistency Assessment in Multi-Context Systems
  • Michael Fink and David Pearce: A Logical Semantics for Description Logic Programs
  • Martin Gebser, Orkunt Sabuncu, and Torsten Schaub: An Incremental Answer Set Programming Based System for Finite Model Computation
  • Ricardo Gonçalves and José Júlio Alferes: Parametrized Logic Programming
  • Mikolas Janota, Radu Grigore, and Joao Marques-Silva: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
  • Szymon Klarman and Victor Gutierrez-Basulto: ALC_ALC: a Context Description Logic
  • Costas Koutras and Yorgos Zikos: Stable Belief Sets Revisited
  • Markus Krötzsch: Efficient Inferencing for OWL EL
  • Vladimir Lifschitz and Fangkai Yang: Translating First-Order Causal Theories into Answer Set Programming
  • Theofrastos Mantadelis, Ricardo Rocha, Angelika Kimmig, and Gerda Janssens: Preprocessing Boolean Formulae for BDDs in a Probabilistic Context
  • David Pearce and Levan Uridia: Minimal Knowledge and Belief via Minimal Topology
  • Chiaki Sakama, Martin Caminada and Andreas Herzig: A Logical Account of Lying
  • Terrance Swift and David Warren: Tabling with Answer Subsumption: Implementation, Applications and Performance
  • Joost Vennekens, Marc Denecker, and Maurice Bruynooghe: Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic
  • Hanne Vlaeminck, Johan Wittocx, Joost Vennekens, Marc Denecker, and Maurice Bruynooghe: An Approximate Method for Solving \exists\forall SO Problems
  • ZhiQiang Zhuang and Maurice Pagnucco: Horn Contraction via Epistemic Entrenchment

System Descriptions

  • Seif El-Din Bairakdar, Minh Dao-Tran, Thomas Eiter, Michael Fink, and Thomas Krennwallner: The DMCS Solver for Distributed Nonmonotonic Multi-Context Systems
  • Markus Bögl, Thomas Eiter, Michael Fink, and Peter Schüller: The MCS-IE System for Explaining Inconsistency in Multi-Context Systems
  • Martin Gebser, Torsten Grote, and Torsten Schaub: Coala: A Compiler from Action Languages to ASP
  • Marco Maratea, Francesco Ricca, and Pierfrancesco Veltri: DLV^{MC}: Enhanced Model Checking in DLV
  • Michael Morak, Reinhard Pichler, Stefan Rümmele, and Stefan Woltran: A Dynamic-Programming Based ASP-Solver