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: CONCUR (2018)
Keyphrases
- first order logic
- finite state machines
- expressive power
- model checking
- propositional logic
- mazurkiewicz traces
- theorem proving
- inference rules
- finite state automata
- theorem prover
- probabilistic reasoning
- markov networks
- inductive logic programming
- temporal logic
- representation language
- probabilistic graphical models
- knowledge representation
- markov logic
- relational algebra
- horn clauses
- quantifier elimination
- transitive closure
- markov logic networks
- pairwise
- quantifier free
- machine learning
- logical rules
- constraint databases
- expert systems
- satisfiability problem