Approximate solutions for the minimal revision problem of specification automata.
Kangjin KimGeorgios FainekosPublished in: IROS (2012)
Keyphrases
- approximate solutions
- np hard
- exact solution
- optimal solution
- hard optimization problems
- finite automata
- knowledge base
- cellular automata
- belief revision
- formal languages
- regular expressions
- formal specification
- specification language
- special case
- tree automata
- probabilistic automata
- energy function
- pattern matching
- higher order
- evolutionary algorithm
- objective function