Sciweavers

799 search results - page 19 / 160
» A Logic for Abstract State Machines
Sort
View
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 3 months ago
A more bio-plausible approach to the evolutionary inference of finite state machines
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
Hooman Shayani, Peter J. Bentley
SEC
2003
14 years 11 months ago
From Finite State Machines to Provably Correct Java Card Applets
Abstract This paper presents a systematic approach to developing Java Card applets and/or formal specifications for them, starting from descriptions in the form of finite state m...
Engelbert Hubbers, Martijn Oostdijk, Erik Poll
ICML
2004
IEEE
15 years 10 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
ICML
2004
IEEE
15 years 10 months ago
Using relative novelty to identify useful temporal abstractions in reinforcement learning
lative Novelty to Identify Useful Temporal Abstractions in Reinforcement Learning ?Ozg?ur S?im?sek ozgur@cs.umass.edu Andrew G. Barto barto@cs.umass.edu Department of Computer Scie...
Özgür Simsek, Andrew G. Barto
ECAI
2004
Springer
15 years 3 months ago
Compilation of LTL Goal Formulas into PDDL
Abstract. Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extend...
Stephen Cresswell, Alexandra M. Coddington