A very sharp threshold for first order logic distinguishability of random graphs.
Itai BenjaminiMaksim ZhukovskiiPublished in: CoRR (2022)
Keyphrases
- first order logic
- random graphs
- expressive power
- graph theoretic
- phase transition
- propositional logic
- theorem proving
- inference rules
- representation language
- probabilistic reasoning
- markov networks
- knowledge representation
- transitive closure
- theorem prover
- inductive logic programming
- probabilistic graphical models
- markov logic
- horn clauses
- undirected graph
- complex networks
- small world
- ranking algorithm
- constraint satisfaction
- power law
- graphical models
- np hard