It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before".
Benedikt BolligMarie FortinPaul GastinPublished in: CoRR (2018)
Keyphrases
- first order logic
- finite state machines
- mazurkiewicz traces
- expressive power
- model checking
- temporal logic
- propositional logic
- inference rules
- theorem proving
- finite state automata
- probabilistic reasoning
- theorem prover
- knowledge representation
- relational algebra
- representation language
- horn clauses
- inductive logic programming
- markov networks
- transitive closure
- regular expressions
- probabilistic graphical models
- constraint databases
- quantifier free
- artificial intelligence
- pairwise
- data mining
- hidden markov models
- highly expressive
- quantifier elimination