A first order logic for specification of timed algorithms: basic properties and a decidable class.
Danièle BeauquierAnatol SlissenkoPublished in: Ann. Pure Appl. Log. (2001)
Keyphrases
- first order logic
- expressive power
- theorem proving
- probabilistic reasoning
- inference rules
- propositional logic
- theorem prover
- transitive closure
- markov networks
- markov logic
- markov logic networks
- timed automata
- logical rules
- function symbols
- representation language
- relational algebra
- inductive logic programming
- probabilistic graphical models
- computational complexity
- search algorithm
- database systems
- machine learning
- data mining