Action language
In
automated planning
.
Action languages fall into two classes:
boolean SAT algorithms to very rapidly ascertain satisfiability
, this implies that action languages can also enjoy the progress being made in the domain of boolean SAT solving.
Formal definition
All action languages supplement the definition of a
state transition system with a set F of fluents
, a set V of values that fluents may take, and a function mapping S × F to V, where S is the set of states of a state transition system.
See also
References
- ^ Michael Gelfond, Vladimir Lifschitz (1998) "Action Languages", Linköping Electronic Articles in Computer and Information Science, vol 3, nr 16.
- ^ Vladimir Lifschitz and Hudson Turner, (1998) "Representing Transition Systems by Logic Programs".
- CiteSeerX 10.1.1.185.4622