Decidable verification for reducible timed automata specified in a first order logic with time.
Danièle BeauquierAnatol SlissenkoPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- first order logic
- timed automata
- model checking
- theorem prover
- theorem proving
- expressive power
- propositional logic
- probabilistic reasoning
- inference rules
- inductive logic programming
- representation language
- transitive closure
- knowledge representation
- probabilistic graphical models
- markov networks
- function symbols
- relational algebra
- markov logic
- markov logic networks
- dl lite
- quantifier elimination
- horn clauses
- special case