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