Action language

<h2 id="formal-definition">Formal definition</h2>
<p>All action languages supplement the definition of a <a href="/facts/State_transition_system/AABVmNzn">state transition system</a> with a set <i>F</i> of <i><a href="/facts/Fluent_(artificial_intelligence)/dUD7jUx9">fluents</a></i>, a set <i>V</i> of values that fluents may take, and a function mapping <i>S</i> × <i>F</i> to <i>V</i>, where <i>S</i> is the set of states of a state transition system.
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Linear_temporal_logic/Gh5yxXK7">Linear temporal logic</a></li>
<li><a href="/facts/GOLOG/2yLnzCKe">GOLOG</a></li>
<li><a href="/facts/Fluent_calculus/Ieuy6qR4">Fluent calculus</a></li>
<li><a href="/facts/Situation_calculus/dGcIavPa">Situation calculus</a></li>
<li><a href="/facts/Event_calculus/82A2yW5H">Event calculus</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Michael Gelfond, Vladimir Lifschitz (1998) "Action Languages", Linköping Electronic Articles in Computer and Information Science, vol 3, nr 16. <a href="/wiki/Michael_Gelfond" target="_blank">/wiki/Michael_Gelfond</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Vladimir Lifschitz and Hudson Turner, (1998) "Representing Transition Systems by Logic Programs". <a href="http://www.d.umn.edu/~hudson/papers/rtslp9.pdf" target="_blank">http://www.d.umn.edu/~hudson/papers/rtslp9.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Gebser, Martin; Grote, Torsten; Schaub, Torsten (2010), Coala: a compiler from action languages to ASP, CiteSeerX 10.1.1.185.4622 <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
</ol>

Action language open-in-new

Action language