<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">REA Press</journal-id>
      <journal-id journal-id-type="publisher-id">null</journal-id>
      <journal-title>REA Press</journal-title><issn pub-type="ppub">3042-1330</issn><issn pub-type="epub">3042-1330</issn><publisher>
      	<publisher-name>REA Press</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi"> https://doi.org/10.48313/uda.v1i1.22</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Situation calculus, LTS model, Modal logic, Knowledge representation</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>A note on situation calculus</article-title><subtitle>A note on situation calculus</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Paraskevas</surname>
		<given-names>Antonios</given-names>
	</name>
	<aff>Department of Applied Informatics, School of Information Sciences, University of Macedonia, Information Systems and e Business Laboratory (ISeB),156, Egnatia Str., 54636, Thessaloniki, Greece.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>06</month>
        <year>2024</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>15</day>
        <month>06</month>
        <year>2024</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <permissions>
        <copyright-statement>© 2024 REA Press</copyright-statement>
        <copyright-year>2024</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/2.5/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p></license>
      </permissions>
      <related-article related-article-type="companion" vol="2" page="e235" id="RA1" ext-link-type="pmc">
			<article-title>A note on situation calculus</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			Situation calculus is a logical language for expressing change. Situations, actions, and fluents are the three core ideas of situation calculus. As agents perform actions, the dynamic environment changes from one situation to another. Fluents are functions that change with the situation and describe the effects of actions. They can be seen as properties of the world that come into existence when an action is initiated and disappear when another action ends. While situation calculus is powerful, it often struggles with complexity and verbosity when modeling dynamic systems, making it challenging to manage and reason about in large-scale settings. We propose using Labelled Transition Systems (LTS) to address these limitations. The LTS model, based on graph models of modal logic, offers a more concise and formal representation of system behaviors. The LTS-based method aims to provide a simpler and more intuitive framework for modeling dynamic settings, thereby improving system representation clarity and efficiency. It allows for higher scalability and more efficient verification and validation processes, which are critical in complex systems. Finally, the LTS model seeks to bridge the theoretical expressiveness of situation calculus with the practical requirements of system design and analysis.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>null</p>
    </ack>
  </back>
</article>