<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>FZI Forschungszentrum Informatik</institution>
          ,
          <addr-line>76131 Karlsruhe</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institut AIFB, Universitaet Karlsruhe (TH)</institution>
          ,
          <addr-line>D-76128 Karlsruhe</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adherence to the completeness properties of reasoning procedures. Despite the large amount of work and results that have been achieved, various benchmarks reinstate that the progress does not suce for needs in the scale of many enterprise applications and the Web. We believe that a fundamental change in research on reasoning is required, giving up basic assumptions such as completeness to gain performance required in many real-world applications. These new paths should start with a deriving a clear understanding of what types of questions should be solved, where reasoning can help, where properties like soundness and completeness are really required and what impact of departing from those properties is acceptable.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The impact of pursuing these paths should be evaluated on top of a
goldstandard - a collection of agreed upon ontologies, agreed upon reasoning tasks
derived from reasoning steps utilized in real world applications and clear metrics.
A consensus on what such a Gold-standard should look like is still to be found.</p>
    </sec>
    <sec id="sec-2">
      <title>Baseline and Gold Standard Denition</title>
      <p>An established baseline would be a strong benet for research related to
reasoning performance. A baseline should be based on a gold-standard ontology as well
as standardized queries involving reasoning towards this ontology. The scope of
these queries should involve queries typically involved in real-world applications.
Therefore a characterization of reasoning potential in applications that we can
see today is a sine qua non for us to identify typical queries. A standard data set
for the performance evaluation should be established using currently available
ontologies compiled from existing ontologies. The baseline for future reasoning
performance should be established using publicly available state-of-the-art
reasoners such as KAON2, RACER or PELLET by measuring response time, setup
time and resource consumption involved in answering the standard queries on
the standard data set.
2</p>
    </sec>
    <sec id="sec-3">
      <title>Incremental Reasoning</title>
      <p>Incremental reasoning leverages caching, i.e. precomputed data structures, to
speed up reasoning at runtime. A trivial approach is to a pre-compute the set of
all implicit information, which comes at the price of potentially large amounts
of memory or space. Several other strategies should be investigated, such as
caching prior queries or caching frequently accessed data or compiling declarative
programs derived from translating logical programs via the logic-correspondence
of the ontology language into executable programs. Another new path could be
to depart from the ASK-TELL interface that we see with the reasoners of today
to a PUBLISH-SUSCRIBE interface where answers are delivered incrementally
and might be revised during the reasoning process.
3</p>
    </sec>
    <sec id="sec-4">
      <title>Approximate Reasoning</title>
      <p>The aforementioned theoretical bounds for existing ontology languages highly
determine runtime behaviour of reasoners that usually aim to provide sound
and complete reasoning procedures. Approximate reasoning tries to optimize
the behaviour by relaxing (in a controlled manner) the requirement for complete
reasoning and thereby decrease the complexity of the reasoning problem. An
important focus of research should lie on controlling the approximation and
understanding the eects of the approximation such that users can understand
what information is potentially missing, as well to how acceptable missing this
information is.
4</p>
    </sec>
    <sec id="sec-5">
      <title>Tractable Reasoning</title>
      <p>
        A paradigm shift in constructing ontology languages would be to push language
features no longer towards the boundaries of expressivity but eliminating
language features to obtain tractable languages. This path can already be observed
in recent research such as [
        <xref ref-type="bibr" rid="ref1 ref4">4, 1</xref>
        ]. Other work that follows this lead is the layered
design of the WSMO family of ontology languages and further simplify WSMO.
Eventually we predict that also languages where sub-polynomial reasoning
complexity can be shown will be of great interest, since this would eventually
decouple reasoning from knowledge base size, i.e. the number of services, what we
perceive to be key to Web scalability tasks.
5
      </p>
    </sec>
    <sec id="sec-6">
      <title>Summary</title>
      <p>While we pursue these new paths in reasoning, researchers should gather on a
yearly basis at an established forum to repeatedly perform pair-wise independent
and reliable performance evaluations 3, where we leverage the baseline and gold
standard data set to continuously measure the improvements - and failures
achieved by the new techniques developed. This would ultimatively assess the
viability of the research paths pursued.
3 A good idea is also to do a continuous evaluation on a set of unit tests based on the
gold standard reasoning tasks where execution should be automatically scheduled
and executed on top of the latest release of the current reasoning prototype</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brandt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lutz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Pushing the EL Envelope</article-title>
          ,
          <article-title>IJCAI 2005</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Umbrich</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Towards a scalable search and query engine for the web</article-title>
          ,
          <source>WWW</source>
          <year>2007</year>
          :
          <fpage>1301</fpage>
          -
          <lpage>1302</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Boris</given-names>
            <surname>Motik</surname>
          </string-name>
          :
          <article-title>Reasoning in Description Logics using Resolution and Deductive Databases</article-title>
          ,
          <source>PhD Thesis</source>
          , Univesiatt Karlsruhe (TH), Karlsruhe, Germany, January 2006
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Raphael</given-names>
            <surname>Volz</surname>
          </string-name>
          :
          <article-title>Web Ontology Reasoning with Logic Databases</article-title>
          ,
          <source>PhD Thesis</source>
          , Univesiatt Karlsruhe (TH), Karlsruhe, Germany, February 2004
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>