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