JELIA 2006: Liverpool, UK

Invited Talks

• Saso Dzeroski:
  From Inductive Logic Programming to Relational Data Mining. 1-14
  
• Ilkka Niemelä:
  Answer Set Programming: A Declarative Approach to Solving Search Problems. 15-18
  
• Andrei Voronkov:
  Inconsistencies in Ontologies. 19
  

Technical Papers

• Vladimir Aleksic, Anatoli Degtyarev:
  On Arbitrary Selection Strategies for Basic Superposition. 20-28
  
• José Júlio Alferes, Federico Banti, Antonio Brogi:
  An Event-Condition-Action Logic Programming Language. 29-42
  
• Ofer Arieli, Marc Denecker, Maurice Bruynooghe:
  Distance-Based Repairs of Databases. 43-55
  
• Alexander Bolotov, Artie Basukoski, Oleg Grigoriev, Vasilyi Shangin:
  Natural Deduction Calculus for Linear-Time Temporal Logic. 56-68
  
• Jan Broersen, Andreas Herzig, Nicolas Troquard:
  A STIT-Extension of ATL. 69-81
  
• Pedro Cabalar, Sergei P. Odintsov, David Pearce, Agustín Valverde:
  On the Logic and Computation of Partial Equilibrium Models. 82-94
  
• Francesco Calimeri, Susanna Cozza, Giovambattista Ianni:
  Decidable Fragments of Logic Programming with Value Invention. 95-110
  
• Martin Caminada:
  On the Issue of Reinstatement in Argumentation. 111-123
  
• Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko:
  Comparing Action Descriptions Based on Semantic Preferences. 124-137
  
• Ulle Endriss, Eric Pacuit:
  Modal Logics of Negotiation and Preference. 138-150
  
• Esra Erdem, Alfredo Gabaldon:
  Representing Action Domains with Numeric-Valued Fluents. 151-163
  
• Christian G. Fermüller, Reinhard Pichler:
  Model Representation over Finite and Infinite Signatures. 164-176
  
• Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli:
  Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies. 177-189
  
• Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
  Analytic Tableau Calculi for KLM Rational Logic R. 190-202
  
• Sergio Greco, Irina Trubitsyna, Ester Zumpano:
  On the Semantics of Logic Programs with Preferences. 203-215
  
• Andreas Herzig, Ivan José Varzinczak:
  A Modularity Approach for a Fragment of ALC. 216-228
  
• Luke Hunsberger:
  Whatever You Say. 229-241
  
• Yulia Korukhova:
  Automatic Deductive Synthesis of Lisp Programs in the System ALISA. 242-252
  
• Zhangang Lin, Yue Ma, Zuoquan Lin:
  A Fault-Tolerant Default Logic. 253-265
  
• Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter:
  Reasoning About Actions Using Description Logics with General TBoxes. 266-279
  
• Emiliano Lorini, Andreas Herzig, Cristiano Castelfranchi:
  Introducing Attempt in a Modal Logic of Intentional Action. 280-292
  
• Alexander V. Lyaletski, Boris Konev:
  On Herbrand's Theorem for Intuitionistic Logic. 293-305
  
• Frederick Maier, Donald Nute:
  Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics. 306-318
  
• Sanjay Modgil:
  Hierarchical Argumentation. 319-332
  
• Cláudia Nalon, Clare Dixon:
  Anti-prenexing and Prenexing for Modal Logics. 333-345
  
• Linh Anh Nguyen:
  A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic ALC. 346-358
  
• Davy Van Nieuwenborgh, Martine De Cock, Dirk Vermeir:
  Fuzzy Answer Set Programming. 359-372
  
• Alexander Nittka:
  Reasoning About an Agent Based on Its Revision History with Missing Inputs. 373-385
  
• Guilin Qi, Weiru Liu, David A. Bell:
  Knowledge Base Revision in Description Logics. 386-398
  
• Emad Saad:
  Incomplete Knowledge in Hybrid Probabilistic Logic Programs. 399-412
  
• Fariba Sadri, Francesca Toni:
  A Formal Analysis of KGP Agents. 413-425
  
• Ján Sefránek:
  Irrelevant Updates and Nonmonotonic Assumptions. 426-438
  
• Umberto Straccia:
  Towards Top-k Query Answering in Description Logics: The Case of DL-Lite. 439-451
  

Tool Descriptions

• Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
  Representing Causal Information About a Probabilistic Process. 452-464
  
• Daniel Bryant, Paul J. Krause, Sotiris Moschoyiannis:
  A Tool to Facilitate Agent Deliberation. 465-468
  
• Daniel Bryant, Paul J. Krause:
  An Implementation of a Lightweight Argumentation Engine for Agent Applications. 469-472
  
• Thomas Eiter, Michael Fink, Ján Senko:
  A Tool for Answering Queries on Action Descriptions. 473-476
  
• Thomas Eiter, Patrick Traxler, Stefan Woltran:
  An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. 477-480
  
• Nuno A. Fonseca, Fernando M. A. Silva, Rui Camacho:
  April - An Inductive Logic Programming System. 481-484
  
• Enrico Giunchiglia, Marco Maratea:
  optsat: A Tool for Solving SAT Related Optimization Problems. 485-489
  
• Ullrich Hustadt, Dmitry Tishkovsky, Frank Wolter, Michael Zakharyaschev:
  Automated Reasoning About Metric and Topology. 490-493
  
• Massimo Narizzano, Luca Pulina, Armando Tacchella:
  The QBFEVAL Web Portal. 494-497
  
• Claudio Ochoa, Josep Silva, Germán Vidal:
  A Slicing Tool for Lazy Functional Logic Programs. 498-501
  
• Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
  ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. 502-505
  
• Massimo Ruffolo, Marco Manna, Lorenzo Gallucci, Nicola Leone, Domenico Saccà:
  A Logic-Based Tool for Semantic Information Extraction. 506-510
  
• Fernando Soler-Toscano, Ángel Nepomuceno-Fernández:
  : Tableaux and Resolution for Finite Abduction. 511-514