Task automata: Schedulability, decidability and undecidability.
Elena FersmanPavel KrcálPaul PetterssonWang YiPublished in: Inf. Comput. (2007)
Keyphrases
- description logics
- query containment
- automata theoretic
- regular expressions
- regular path queries
- conjunctive queries
- query answering
- temporal logic
- knowledge representation
- finite automata
- cellular automata
- knowledge base
- answering queries
- transitive closure
- dl lite
- tree automata
- probabilistic automata
- inverse roles
- finite state
- neural network
- decision procedures
- finite state machines
- modal logic
- integrity constraints
- finite automaton
- lattice gas
- query evaluation
- data exchange
- expressive power
- exptime complete
- np complete
- number restrictions
- query language
- databases