Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic.
Sandra KieferPascal SchweitzerPublished in: CoRR (2016)
Keyphrases
- first order logic
- upper bound
- quantifier elimination
- expressive power
- lower bound
- inference rules
- probabilistic reasoning
- propositional logic
- theorem proving
- knowledge representation
- relational structures
- theorem prover
- inductive logic programming
- markov networks
- representation language
- transitive closure
- probabilistic graphical models
- quantifier free
- relational algebra
- directed graph
- horn clauses
- tree decomposition
- directed acyclic graph
- markov logic networks
- closure operator
- markov logic
- tree width