ONTOLP-2015

Ontologies and Logic Programming for Query Answering
http://ontolp.lsis.org
This international workshop is one of the joint ontology workshops JOWO 2015 affiliated with the 24th International Joint Conference on Artificial Intelligence (IJCAI-2015, http://ijcai-15.org) and
will take place in Buenos Aires, Argentina, July 25th, 2015 .
New building of Facultad de Ciencias Economicas, University of Buenos Aires
Pres. José Evaristo Uriburu 781, Buenos Aires, Ciudad de Buenos Aires
Organisers
Program Committee
Topics
Workshop Description
Call for papers
Invited Talks
Program

INVITED TALKS

Steven Schockaert (Cardiff University): Extending Answer Set Programming using Generalized Possibilistic Logic

Andreas Pieris (Vienna University of Technology): From Classical to Consistent Query Answering under Existential Rules

PROCEEDINGS : proceedings

PROGRAM pdf

8:30 Welcome
8:45-9:40 Invited talk

  • Steven Schockaert slides
    Extending Answer Set Programming using Generalized Possibilistic Logic.

9:40-10:30 Logic Programming 1

  • 9:40-10:05 Riccardo Zese, Elena Bellodi, Evelina Lamma, Fabrizio Riguzzi. slides
    Logic Programming Techniques for Reasoning with Probabilistic Ontologies.
  • 10:05-10:30 Fabien Garreau, Laurent Garcia, Claire Lefèvre, Igor Stéphan. slides
    exists-ASP

10:30-11:00 Coffee break
11:00-12:15 Description Logic

  • 11:00-11:25 Veronica Dahl, Sergio Tessaris, Thom Fruehwirth. slides
    Imperfect Querying through Womb Grammars plus Ontologies.
  • 11:25-11:50 Roberto Confalonieri, Manfred Eppe, Marco Schorlemmer, Oliver Kutz, Rafael Peñaloza, Enric Plaza. slides
    Upward Refinement for Conceptual Blending in Description Logic: An ASP-based Approach and Case Study in EL++.
  • 11:50-12:15 Nuno Costa, Matthias Knorr, Joao Leite. slides
    Extending NoHR for OWL 2 QL.

12:45-13:45 Lunch break
13:45 -14:40 Invited talk

  • Andreas Pieris. slides
    From Classical to Consistent Query Answering under Existential Rules.

14:40-15:30 Logic Programming 2

  • 14:40-15:05 Cristina Feier, Thomas Eiter. slides
    Reasoning with Forest Logic Programs Using Fully Enriched Automata.
  • 15:05-15:30 Ricardo Gonçalves. slides
    Combining rules and ontologies via parametrized logic programming.

15:30-16:00 Coffee break
16:00-17:30 Inconsistency Handling

  • 16:00-16:25 Cristhian Ariel David Deagustini, Maria Vanina Martinez, Marcelo A. Falappa, Guillermo Simari. slides
    On the Influence of Incoherence in Inconsistency-tolerant Semantics for Datalog+-.
  • 16:25-16:50 Badrinath Jayakumar, Rajshekhar Sunderraman. slides
    Paraconsistent Relational Model: A Quasi-Classic Logic Approach.
  • 16:50-17:15 Zied Bouraoui, Salem Benferhat, Sylvain Lagrue, Julien Rossit. slides
    Merging Incommensurable Possibilistic DL-Lite Assertional Bases

17:15-17:45 Concluding discussion

Contact:

This workshop receives support from ANR (French National Research Agency), ASPIQ project reference ANR-12-BS02-0003. (http://www.agence-nationale-recherche.fr/)

Related link: JOWO 2015 http://www.iaoa.org/jowo/
*************************************************************
ORGANISERS
Ontologies and Logic Programming for Query Answering
http://ontolp.lsis.org

Organisers:

*************************************************************
PROGRAM COMMITTEE
Ontologies and Logic Programming for Query Answering
http://ontolp.lsis.org

Program committee:

  • Maria Teresa Alsinet Bernado (University of Lleida, Spain)
  • Jean-François Baget (INRIA, Montpellier, France)
  • Chitta Baral (Arizona State University, U.S.A.)
  • Madalina Croitoru (University of Montpellier 2, France)
  • Jim Delgrande (Simon Fraser University, Vancouver. Canada)
  • Thomas Eiter (Vienna University of Technology. Austria)
  • Jérôme Euzenat (INRIA, Grenoble, France)
  • Eduardo Fermé (University of Madeira, Portugal)
  • Sergio Alejandro Gomez (Universidad Nacional del Sur Alem, Argentin)
  • Fabio Grandi (University of Bologna, Italy)
  • Guido Governatori (NICTA Queensland, Australia)
  • John Horty (University of Maryland, U.S.A.)
  • Gabriele Kern-Isberner (University of Dortmund , Germany)
  • Sylvain Lagrue (University of Artois, France)
  • Claire Lefèvre (University of Angers, France)
  • Joao Leite (University of Lisbon, Portugal)
  • Nicola Leone (University of Calabria, Italy)
  • Stéphane Loiseau (University of Angers, France)
  • Thomas Lukasiewicz (University of Oxford. U.K.)
  • Robert E. Mercer (University of Western Ontario, Canada)
  • Thomas Meyer (CSIR Meraka Institute, Pretoria, South of
    Africa)
  • Farid Nouioua (Aix Marseille University, France)
  • Guilin Qi (Southeast University, China)
  • Vincent Risch (Aix Marseille University, France)
  • Riccardo Rosati (University La Sapienza, Roma, Italy)
  • Marie-Christine Rousset (University of Grenoble, France)
  • Torsten Schaub (University of Potsdam. Germany)
  • Steven Schockaert (Cardiff University. U.K.)
  • Guillermo Simari (University Bahia blanca, Argentine)
  • Igor Stephan (University of Angers, France)
  • Umberto Straccia (ISTI-CNR, Pisa, Italy)
  • Kewen Wang (Griffith University. Australia)
  • Stefan Woltran (Vienna University of Technology, Austria)
  • Eric Würbel (University of Toulon, France)

    *************************************************************
    TOPICS
    Ontologies and Logic Programming for Query Answering
    http://ontolp.lsis.org

    Topics of interest include but are not limited to:

    • Reasoning with lightweight ontologies
    • Reasoning with tractable fragments of OWL languages
    • Belief change & tractable Description logics
    • Reasoning on the web of data
    • Ontology-based data-access
    • Ontological query answering
    • Belief change & ASP
    • Datalog+/- & existential rules
    • ASP & description logics
    • ASP & uncertainty
    • First-order ASP
    • Rulelog

    *************************************************************
    WORKSHOP DESCRIPTION
    Ontologies and Logic Programming for Query Answering
    http://ontolp.lsis.org

    Workshop description
    The aim of this workshop is to bridge knowledge representation and reasoning in artificial intelligence and web of knowledge communities in order to encourage the emergence of new solutions for reasoning with lightweight ontologies.

    • Query answering while taking ontologies into account.
    • Non monotonic reasoning for inconsistency handling and exception handling and expressing default negations in ontologies.

    Concerning the first point, a challenging issue is how to adapt or extend Answer Set Programming to represent ontological knowledge. In particular, can (a fragment of) ASP cover lightweight ontological languages while keeping decidability and efficiency?

    Concerning the second point, a challenging issue is how to extend lightweight ontological languages with non-monotonic features, while keeping a good computational complexity. In particular,

    • how to embed exceptions-based and inconsistency tolerant-based reasoning in a tractable ontological language?
    • how to integrate uncertainty information in lightweight ontological languages?
    • how to define merging operations where both inputs and outputs are in lightweight ontological languages?

    *************************************************************
    CALL FOR PAPERS
    CALL FOR PAPERS
    Ontologies and Logic Programming for Query Answering
    http://ontolp.lsis.org

    This international workshop is affiliated with the 24th International Joint Conference on Artificial Intelligence (IJCAI-2015, http://ijcai-15.org) and will take place in Buenos Aires, Argentina, July , 2015.

    Workshop description
    The aim of this workshop is to bridge knowledge representation and reasoning in artificial intelligence and web of knowledge communities in order to encourage the emergence of new solutions for reasoning with lightweight ontologies.

    • Query answering while taking ontologies into account.
    • Non monotonic reasoning for inconsistency handling and exception handling and expressing default negations in ontologies.

    Concerning the first point, a challenging issue is how to adapt or extend Answer Set Programming to represent ontological knowledge. In particular, can (a fragment of) ASP cover lightweight ontological languages while keeping decidability and efficiency?

    Concerning the second point, a challenging issue is how to extend lightweight ontological languages with non-monotonic features, while keeping a good computational complexity. In particular,

    • how to embed exceptions-based and inconsistency tolerant-based reasoning in a tractable ontological language?
    • how to integrate uncertainty information in lightweight ontological languages?
    • how to define merging operations where both inputs and outputs are in lightweight ontological languages?

    Topics of interest include but are not limited to:

    • Reasoning with lightweight ontologies
    • Reasoning with tractable fragments of OWL languages
    • Belief change & tractable Description logics
    • Reasoning on the web of data
    • Ontology-based data-access
    • Ontological query answering
    • Belief change & ASP
    • Datalog+/- & existential rules
    • ASP & description logics
    • ASP & uncertainty
    • First-order ASP
    • Rulelog

    The workshop is expected to bring together people from different
    research communities that are actively pursuing this line of
    research.

    Paper submission
    The authors should submit their paper via EasyChair:
    https://easychair.org/conferences/?conf=ontolp2015

    We expect submissions of both mature and preliminary works. Long papers will not exeed 8 pages and short papers will not exceed 4 pages in pdf formatted using the AAAI style according to the instructions at
    http://www.aaai.org/Publications/Author/author.php

    After the workshop, the authors of accepted papers will be invited to submit an extended version for inclusion in a special issue of the Annals of Mathematics and Artificial Intelligence (AMAI) journal published by Springer.

    Important dates

    • Paper submission deadline: April 27, 2015.
      New deadlines :
      Abstract submission deadline: as soon as possible,
      Paper submission deadline: May 10, 2015.
    • Notification of acceptance: May 20, 2015
    • Camera ready papers: May 30, 2015
    • Workshop date: July 25-27 2015

    Program committee

    • Maria Teresa Alsinet Bernado (University of Lleida, Spain)
    • Jean-François Baget (INRIA, Montpellier, France)
    • Chitta Baral (Arizona State University, U.S.A.)
    • Madalina Croitoru (University of Montpellier 2, France)
    • Jim Delgrande (Simon Fraser University, Vancouver. Canada)
    • Thomas Eiter (Vienna University of Technology. Austria)
    • Jérôme Euzenat (INRIA, Grenoble, France)
    • Eduardo Fermé (University of Madeira, Portugal)
    • Sergio Alejandro Gomez (Universidad Nacional del Sur Alem, Argentina)
    • Fabio Grandi (University of Bologna, Italy)
    • Guido Governatori (NICTA Queensland, Australia)
    • John Horty (University of Maryland, U.S.A.)
    • Gabriele Kern-Isberner (University of Dortmund , Germany)
    • Sylvain Lagrue (University of Artois, France)
    • Claire Lefèvre (University of Angers, France)
    • Joao Leite (University of Lisbon, Portugal)
    • Nicola Leone (University of Calabria, Italy)
    • Stéphane Loiseau (University of Angers, France)
    • Thomas Lukasiewicz (University of Oxford. U.K.)
    • Robert E. Mercer (University of Western Ontario, Canada)
    • Thomas Meyer (CSIR Meraka Institute, Pretoria, South of
      Africa)
    • Farid Nouioua (Aix Marseille University, France)
    • Guilin Qi (Southeast University, China)
    • Vincent Risch (Aix Marseille University, France)
    • Riccardo Rosati (University La Sapienza, Roma, Italy)
    • Marie-Christine Rousset (University of Grenoble, France)
    • Torsten Schaub (University of Potsdam. Germany)
    • Steven Schockaert (Cardiff University. U.K.)
    • Guillermo Simari (University Bahia blanca, Argentine)
    • Igor Stéphan (University of Angers, France)
    • Umberto Straccia (ISTI-CNR, Pisa, Italy)
    • Kewen Wang (Griffith University. Australia)
    • Stefan Woltran (Vienna University of Technology, Austria)
    • Eric Würbel (University of Toulon, France)

      Chairs:

      Contact: Odile Papini, odile.papini@univ-amu.fr

      This workshop receives support from ANR (French National Research Agency),
      (http://www.agence-nationale-recherche.fr/) ASPIQ project reference ANR-12-BS02-0003.(http://aspiq.lsis.org/)
      *************************************************************
      INVITED TALKS
      INVITED SPEAKERS

      Steven Schockaert (Cardiff University)
      Extending Answer Set Programming using Generalized Possibilistic Logic
      Abstract: Answer set programming (ASP) is a form of logic programming in which negation-as-failure is defined in a purely declarative way, based on the notion of a stable model. In this talk, I will explain how a recent generalization of possibilistic logic (GPL) can be used to characterize the semantics of answer set programming. This characterization has several advantages over existing characterizations of the stable model semantics. First, unlike reduct-based approaches, it does not rely on a syntactic procedure: we can directly characterize answer sets based on the minimally specific models of a GPL theory. Second, GPL enables us to study extensions of ASP in an intuitive way: unlike in existing generalizations of ASP such as equilibrium logic and autoepistemic logic, all formulas in GPL have a meaning which is intuitively clear. Finally, being based on possibilistic logic, GPL offers a natural way of dealing with uncertainty in answer set programs.

      Andreas Pieris (Vienna University of Technology)
      From Classical to Consistent Query Answering under Existential Rules
      Abstract:We consider the well-known setting of ontology-based query answering. In real-life applications, involving large amount of data, it is possible that the data are inconsistent with the ontology. Since standard ontology languages adhere to the classical first-order logic semantics, inconsistencies are nothing else than logical contradictions. Therefore, the classical inference semantics fails terribly when faced an inconsistency, since everything is inferred from a contradiction. Querying inconsistent knowledge bases is an intriguing new problem that gave rise to a flourishing research activity in the KR community. In this talk, we focus on rule-based ontology languages, and we demonstrate the tight connection between classical and consistent query answering. More precisely, we focus on the standard inconsistency-tolerant semantics, namely, the ABox repair (AR) semantics, and we establish generic complexity results that allow us to obtain in a uniform way a relatively complete picture of the complexity of our problem. We also discuss sound approximations of the AR semantics, with the aim of achieving tractability of consistent query answering in data complexity.
      *************************************************************
      PROGRAM
      Workshop W13 : Ontologies and Logic Programming for Query Answering

      July 25th 2015
      New building of Facultad de Ciencias Economicas, University of Buenos Aires
      Pres. José Evaristo Uriburu 781, Buenos Aires, Ciudad de Buenos Aires.

      PROCEEDINGS proceedings

      PROGRAM pdf

      8:30 Welcome
      8:45-9:40 Invited talk

      9:40-10:30 Logic Programming 1

      10:30-11:00 Coffee break
      11:00-12:15 Description Logic

      12:45-13:45 Lunch break
      13:45 -14:40 Invited talk

      14:40-15:30 Logic Programming 2

      15:30-16:00 Coffee break
      16:00-17:30 Inconsistency Handling

      17:15-17:45 Concluding discussion
      *************************************************************