<!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>Reasoning in the Situation Calculus with Limited Belief Extended Abstract</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>The Epistemic Situation Calculus</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Christoph Schwering School of Computer Science and Engineering The University of New South Wales Sydney NSW 2052</institution>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>[McCarthy, 1963] John McCarthy. Situations, actions, and causal laws. Technical report, Stanford University</institution>
          ,
          <addr-line>1963</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>[Reiter, 2001] Ray Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. The MIT Press</institution>
          ,
          <addr-line>2001</addr-line>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>[Schwering, 2017] Christoph Schwering. A reasoning system for a first-order logic of limited belief. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence</institution>
          ,
          <addr-line>2017</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Action formalisms like the situation calculus [McCarthy, 1963; Reiter, 2001] are powerful tools for modelling dynamic domains. However, these formalisms, typically based on firstorder logic, are also notorious for having little practical relevance due to their computational complexity. This paper introduces an expressive yet computationally feasible variant of the situation calculus. To this end, we amalgamate the situation calculus with a first-order logic of limited belief [Schwering, 2017]. Queries are evaluated at a specific belief level, which intuitively limits the maximum allowed reasoning effort. Reasoning in this logic is sound and decidable. An implementation has been made available.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>[Lakemeyer and Levesque, 2011] Gerhard Lakemeyer and
Hector J. Levesque. A semantic characterization of a useful
fragment of the situation calculus with knowledge.
Artificial Intelligence, 175(1), 2011.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>