<!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>
      <title-group>
        <article-title>Rulelog: Highly Expressive Semantic Rules with Scalable Deep Reasoning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Benjamin N. Grosof</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael Kifer</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paul Fodor</string-name>
          <email>paul.fodor@coherentknowledge.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Accenture</institution>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Coherent Knowledge Systems</institution>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Rulelog in Ergo</institution>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Stony Brook University</institution>
          ,
          <addr-line>New York</addr-line>
          ,
          <country>USA michael.kifer</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this half-day tutorial, we cover the fundamental concepts, key technologies, emerging applications, recent progress, and outstanding research issues in the area of Rulelog, a leading approach to fully semantic rule-based knowledge representation and reasoning (KRR). Rulelog matches well many of the requirements of cognitive computing. It combines deep logical/probabilistic reasoning tightly with natural language processing (NLP), and complements machine learning (ML). Rulelog interoperates and composes well with graph databases, relational databases, spreadsheets, XML, and expressively simpler rule/ontology systems and can orchestrate overall hybrid KRR. Developed mainly since 2005, Rulelog is much more expressively powerful than the previous state-of-the-art practical KRR approaches, yet is computationally affordable. It is fully semantic and has capable efficient implementations that leverage methods from logic programming and databases, including dependency-aware smart caching and a dynamic compilation stack architecture.</p>
      </abstract>
      <kwd-group>
        <kwd>knowledge representation and reasoning</kwd>
        <kwd>declarative logic programs</kwd>
        <kwd>semantic rules</kwd>
        <kwd>cognitive computing</kwd>
        <kwd>natural language processing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Grosof et. al
inference engine, we will illustrate Rulelog’s applications in deep reasoning and
representing complex knowledge such as policies, regulations/contracts, science, and
terminology mappings across a wide range of tasks and domains in business, government,
and academe. Examples include: legal/policy compliance, e.g., in financial services;
financial reporting/accounting; health care treatment guidance and insurance;
education/tutoring; security/confidentiality policies; and e-commerce marketing.</p>
      <p>
        In this tutorial on Rulelog as it is implemented in Ergo, we will cover some unique
KRR features, such as:
– frame-based object-oriented frame syntax [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and higher-order statements [
        <xref ref-type="bibr" rid="ref10 ref3">3, 10</xref>
        ]
for practical logical knowledge representation;
– rule identifiers and provenance, argumentation-based defeasible reasoning [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ];
– general quantification and general formulas [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ];
– ErgoText, an integration of logic with controlled natural language phrases
(sprinkled with variables and other syntactic elements), which are translated to logic
sentences;
– probabilistic reasoning and weighted uncertainty with restraint bounded rationality,
including distribution semantics [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], and evidential probability [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ];
– external querying and virtual data stores;
– dynamically evolving knowledge [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and hypothetical reasoning, including integrity
constraints and alarms;
– explanations that are fully detailed, interactively navigable, and presented in natural
language – understandable by those who are not expert in logic or programming [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>Much of this tutorial will be dedicated to applications of Ergo, both horizontally
(e.g., policy-based decisions, info Integration, analytics, human-computer interaction
(HCI), search, business intelligence, risk management) and vertically (e-commerce and
marketing, financial services, personalized e-learning, security and defense, biomedical,
insurance, Internet of Things (IoT), social media sharing policies).</p>
      <p>Finally, we will discuss open research topics in Ergo, such as, authoring rules
starting from NL, distributed reasoning, optimization of uncertainty reasoning, equality,
aggregates, integration with ASP, constraint solving, and classical logic, hypotheticals,
abduction and integration with ML.</p>
      <p>The goal of the tutorial is for the audience to walk away with an understanding
of Rulelogs key innovative logical and inferencing concepts, its broad applicability, its
overall advantages and limitations, a sample of some specific application areas, and its
open research topics.</p>
      <p>The intended audience for this tutorial is the rules and reasoning community (all
of the RuleML+RR audience) and the assumed background of the participants is only
the basics of first-order-logic and relational databases. Knowledge of declarative logic
programs, XML, RDF, and SPARQL will be helpful but not required.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Andersen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benyo</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calejo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fodor</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grosof</surname>
            ,
            <given-names>B.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kifer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Swift</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Advanced knowledge base debugging for rulelog</article-title>
          .
          <source>In: Joint Proceedings of the 7th International Rule Challenge</source>
          ,
          <article-title>the Special Track on Human Language Technology and the 3rd RuleML Doctoral Consortium</article-title>
          , Seattle, USA, July
          <volume>11</volume>
          -
          <issue>13</issue>
          ,
          <year>2013</year>
          (
          <year>2013</year>
          ), http:// ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1004</volume>
          /paper8.pdf
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bonner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kifer</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Transaction logic: Unifying declarative and procedural knowledge (</article-title>
          <year>1993</year>
          ), manuscript
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kifer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warren</surname>
            ,
            <given-names>D.:</given-names>
          </string-name>
          <article-title>HiLog: A foundation for higher-order logic programming</article-title>
          .
          <source>Journal of Logic Programming</source>
          <volume>15</volume>
          (
          <issue>3</issue>
          ),
          <fpage>187</fpage>
          -
          <lpage>230</lpage>
          (
          <year>February 1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Grosof</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Rapid text-based authoring of defeasible higher-order logic formulas, via textual logic and rulelog</article-title>
          . In: Morgenstern,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Stefaneas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Lvy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Wyner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Paschke</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.) Theory, Practice, and
          <source>Applications of Rules on the Web, Lecture Notes in Computer Science</source>
          , vol.
          <volume>8035</volume>
          , pp.
          <fpage>2</fpage>
          -
          <lpage>11</lpage>
          . Springer Berlin Heidelberg (
          <year>2013</year>
          ), http://dx.doi.org/ 10.1007/978-3-
          <fpage>642</fpage>
          -39617-
          <issue>5</issue>
          _
          <fpage>2</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kifer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lausen</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
          </string-name>
          , J.:
          <article-title>Logical foundations of object-oriented and frame-based languages</article-title>
          .
          <source>Journal of ACM</source>
          <volume>42</volume>
          ,
          <fpage>741</fpage>
          -
          <lpage>843</lpage>
          (
          <year>July 1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kyburg</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teng</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          : Uncertain Inference.
          <source>Uncertain Inference</source>
          , Cambridge University Press (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Riguzzi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Swift</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics</article-title>
          .
          <source>Theory and Practice of Logic Programming</source>
          <volume>13</volume>
          (
          <issue>2</issue>
          ),
          <fpage>279</fpage>
          -
          <lpage>302</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Wan</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grosof</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kifer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fodor</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Logic programming with defaults and argumentation theories</article-title>
          .
          <source>In: Int'l Conference on Logic Programming (July</source>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Wan</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kifer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grosof</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Defeasibility in answer set programs with defaults and argumentation rules</article-title>
          .
          <source>Semantic Web Journal</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kifer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Reasoning about anonymous resources and meta statements on the Semantic Web</article-title>
          .
          <source>Journal on Data Semantics, LNCS 2800 1</source>
          ,
          <fpage>69</fpage>
          -
          <lpage>98</lpage>
          (
          <year>September 2003</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>