News

The ORE Winners of this year's live competition were: 
OWL DL Classification: WSClassifier, OWL EL Classification: ELK.
For the offline competition:
OWL DL Classification: HermiT, OWL DL Consistency: Konclude, OWL DL Satisfiability: Konclude;
OWL EL Classification: ELK, OWL EL Consistency: ELK, OWL EL Satisfiability:Chainsaw;
OWL RL Classification: TReasoner, OWL RL Consistency: Konclude, OWL RL Satisfiability: MORe. MORe also won the Best Newcomer Award. 
Full details are available from the Opens external link in new windowORE website.

This year, the Opens internal link in current windowDistinguished Student Paper Award goes to the paper "Temporal Query Answering in DL-Lite" by Stefan Borgwardt, Marcel Lippmann and Veronika Thost.

Opens internal link in current windowThe informal proceedings of the workshop are now available from Opens external link in new windowCEUR-WS.org and as a Initiates file downloadzipped file for offline reading. 

Opens internal link in current windowThe Initiates file downloadprogram for DL 2013 is now available. The Initiates file downloadprint template also includes some information about the venue, guided tour and the social dinner. 

Opens internal link in current windowStudent grants have been announced. 

Opens internal link in current windowRegistration is now open!

Abstract and paper submission deadlines have been extended by one week!

As in previous years, the DL Workshop will consider to select one or more Distinguished Student Papers among the accepted submissions that are authored without the direct participation of senior researchers. [Opens internal link in current windowmore]

Opens external link in new windowMichel DumontierOpens external link in new windowGiuseppe De Giacomo, and Opens external link in new windowIan Pratt-Hartmann will give invited talks at DL 2013. 

The second Opens external link in new windowOWL Reasoner Evaluation Workshop (ORE) will take place July 22nd in Ulm, Germany.

Opens external link in new windowRR 2013 will take place in Mannheim, which is 1:40 min by train from Ulm, directly subsequent to the DL workshop (July 27th - 29th)! Followed by the Opens external link in new window9th Reasoning Web Summer School (July 30th - Aug 2nd) also in Mannheim. 

DL 2013 will take place from July 23rd to 26th in Ulm, Germany.

We thank our sponsors:

 

Ian Pratt-Hartmann (University of Manchester, UK)

Transitivity and Equivalence in Decidable Fragments of First-Order Logic

Abstract:
Of all the properties of binary relations encountered in logic, those of transitivity and equivalence are perhaps the most salient. On the other hand, it is well-known that these properties are typically not expressible in fragments of first-order logic for which the satisfiability problem is known to be decidable - most notably, the two-variable fragment and the guarded fragment. The question therefore arises as to what happens to familiar, decidable fragments of first-order logic under the assumption that a specified collection of binary predicates be interpreted as transitive relations or as equivalences. This question has been the subject of intensive study in the past few years, and my talk summarizes the current state of play in this area.

Short CV:
Ian Pratt-Hartmann studied Mathematics and Philosophy at Brasenose College, Oxford, and Philosophy at Princeton and Stanford Universities, gaining his PhD. from Princeton in 1987. He is currently Senior Lecturer in the Department of Computer Science at the University of Manchester. Dr. Pratt-Hartmann's research interests range widely over the fields of computational logic, spatial logic and natural language semantics.

Giuseppe De Giacomo (Sapienza Universita di Roma, Italy)

Actions, Processes, and Ontologies

Abstract:
We overview reasoning about actions and processes over ontologies (or knowledge bases) expressed in Description Logics (DLs). This is a critical research challenge that has resisted good, robust solutions for a long time. In particular, while well-developed theories of actions and processes exist in AI, e.g., the ones based on the Situation Calculus, these theories are not well-behaved when applied to DL ontologies, since the latter impose very difficult state constraints. Here we restate this difficulty, by showing that combining even the simplest DLs and the simplest theory of actions in Situation Calculus leads to undecidability of the simplest reasoning task: satisfiability. We then look into a radically different approach, based on so-called Levesque’s functional view of knowledge bases, that has been proved quite fruitful lately. This approach sees the knowledge base (or ontology) as a system that allows for two kinds of operations: ASK, which returns the (certain) answer to queries, and TELL, which produces a new knowledge base as the result of the application of an atomic action (also related to update). In particular we show that under this view even verification of sophisticated dynamic properties (e.g., formulated in first-order variants of mu-calculus) over ontologies expressed in DLs, ranging from light-weight to very expressive ones, becomes decidable under interesting general conditions.

Short CV:
Giuseppe De Giacomo is a professor at Sapienza Universita' di Roma. He has contributed to diverse areas of AI and CS. In the mid 90's, he explored the correspondence between Description Logics and Logics of Programs, and devised results and reasoning techniques for expressive Description Logics, which contributed to the birth of OWL and OWL2. At the end of the 90', together with his group in Rome, he started the research on conjunctive query answering in Description Logics. He is one of the developers of the DL-Lite family of Description Logics, which have been recently shaping the area of Ontology-Based Data Access. In Databases, he did foundational work on data modeling, data integration, and view based query processing with regular path queries, for both semi-structured and graph data. He has always had a deep interest for Reasoning about Actions and Processes. He profoundly influenced the definition of ConGolog and its successor IndiGolog, which are among the best known formalism for expressing high-level robot programs. He devised one of the best known formal approaches for service composition, the so-called ``Roman Model'', which has been further developed in AI for behavior compositions synthesis of devices and agents. Recently, he provided foundational results on artifact-based business processes, showing the decidability of verification and synthesis in infinite state data-aware systems.

Michel Dumontier (Carleton University, Ottawa, Canada)

Drugs, Genetics and Phenotypes: an Admission of Formal Semantics in Biomedical Research

Abstract:
With its focus on investigating the nature and basis for the sustained existence of living systems, modern biology has always been a fertile, if not challenging, domain for formal knowledge representation and automated reasoning. Over the past 15 years, hundreds of projects have developed or leveraged ontologies for entity recognition and relation extraction, semantic annotation, data integration, query answering, consistency checking, association mining and other forms of knowledge discovery. In this talk, I will discuss our efforts to build a rich foundational network of ontology-annotated linked data, discover significant biological associations across these data using a set of partially overlapping ontologies, and identify new avenues for drug discovery by applying measures of semantic similarity over phenotypic descriptions. As the portfolio of Semantic Web technologies continue to mature in terms of functionality, scalability and an understanding of how to maximize their value, increasing numbers of biomedical researchers will be strategically poised to pursue increasingly sophisticated KR projects aimed at improving our overall understanding of the capability and behaviour of biological systems.

Short CV:
Dr. Michel Dumontier, PhD is an Associate Professor of Bioinformatics in the Department of Biology, the Institute of Biochemistry and School of Computer Science at Carleton University in Ottawa, Canada. His research focuses on the development of computational methods to increase our understanding of how living systems respond to chemical agents. At the core of the research program is the development and use of Semantic Web technologies to formally represent and reason about data and services so as (1) to facilitate the publishing, sharing and discovery of scientific knowledge produced by individuals and small collectives, (2) to enable the formulation and evaluation scientific hypotheses using our collective tools and knowledge and (3) to create and make available computational methods to investigate the structure, function and behaviour of living systems. Dr. Dumontier serves as a co-chair for the World Wide Web Consortium Semantic Web in Health Care and Life Sciences Interest Group (W3C HCLSIG) and is the Scientific Director for Bio2RDF, a widely used open-source project to create and provide linked data for life sciences. 

Session Recordings

Veranstaltungen der Universitaet Ulm
Veranstaltungen der Universitaet Ulm - Alle Rechte vorbehalten
Materialization Calculus for Contexts in the Semantic Web
24/07 - 2013
Computing Solutions in OWL 2 QL Knowledge Exchange
26/07 - 2013
Towards Typed Higher-Order Description Logics
26/07 - 2013
Using the TBox to Optimise SPARQL Queries
23/07 - 2013
Complexity of Answering Counting Aggregate Queries over DL-Lite
23/07 - 2013
Tractability Guarantees for DL-Lite Query Answering
23/07 - 2013
Action, Processes and Ontologies (Keynote)
23/07 - 2013
Empirical Study of Logic-based Modules: Cheap is Cheerful
23/07 - 2013
Incremental Reasoning in EL+ without Bookkeeping
23/07 - 2013
Optimising Resolution-Based Rewriting Algorithms for DL Ontologies
23/07 - 2013
CFDnc: A PTIME Description Logic with Functional Constraints and Disjointness
23/07 - 2013
Sufficient Conditions for First-Order and Datalog Rewritability in ELU
23/07 - 2013
Hybrid Unification in the Description Logic EL
23/07 - 2013
Axiomatizing Confident EL_gfp-General Concept Inclusions in the Presence of...
24/07 - 2013
A Hybrid Approach for Learning Concept Definitions from Text
24/07 - 2013
Absorption for ABoxes with Local Universal Restrictions
24/07 - 2013
Exact Learning of TBoxes in DL-Lite and EL
24/07 - 2013
Query Answering via Modal Definability with FaCT++: First Blood (only second...
23/07 - 2013
Query Rewriting over Shallow Ontologies
23/07 - 2013
Evaluating Mapping Repair Systems with Large Biomedical Ontologies
24/07 - 2013
Temporal Query Answering in DL-Lite
24/07 - 2013
Extending Absorption to Nominal Schemas
24/07 - 2013
Temporalising OWL 2 QL
24/07 - 2013
Evolving Graph Databases under Description Logic Constraints
24/07 - 2013
The Empirical Robustness of Description Logic Classification
24/07 - 2013
Computing the lcs w.r.t. General EL+-TBoxes
26/07 - 2013
Rough EL Completion
25/07 - 2013
Finite Model Reasoning in Horn-SHIQ
25/07 - 2013
Ontology-Based Access to Probabilistic Data
25/07 - 2013
Nonmonotonic Existential Rules for Non-Tree-Shaped Ontological Modelling
25/07 - 2013
Towards Practical Uniform Interpolation and Forgetting for ALC TBoxes
26/07 - 2013
Efficient approximation in DL-Lite of OWL 2 ontologies
26/07 - 2013
Minimal Model Semantics and Rational Closure in Description Logics
25/07 - 2013
Preferential Role Restrictions for ALC
25/07 - 2013
Well-Founded Semantics for Extended Datalog and Ontological Reasoning
25/07 - 2013
Transitivity and Equivalence in Decidable Fragments of First-Order Logic
25/07 - 2013
Drugs, Genetics and Phenotypes: an Admission of Formal Semantics in Biomedical...
24/07 - 2013
Conjunctive Query Inseparability in OWL 2 QL is ExpTime-hard
26/07 - 2013
More is Sometimes Less: Succinctness in EL
26/07 - 2013