756 search results - page 20 / 152 » Can Abstract State Machines Be Useful in Language Theory |
DALT
2005
Springer
14 years 1 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
AI
2011
Springer
13 years 3 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
KBSE
2008
IEEE
14 years 2 months ago
2008
IEEE
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
CICLING
2007
Springer
14 years 2 months ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
IANDC
2008
13 years 8 months ago
2008
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...