Efficient elimination of Skolem functions in first-order logic without equality.
Ján KomaraPublished in: CoRR (2019)
Keyphrases
- first order logic
- expressive power
- propositional logic
- inference rules
- theorem proving
- probabilistic reasoning
- markov networks
- function symbols
- probabilistic graphical models
- representation language
- knowledge representation
- theorem prover
- transitive closure
- horn clauses
- predicate calculus
- inductive logic programming
- relational algebra
- constraint databases
- relational structures
- quantifier free
- higher order
- markov logic networks
- database
- highly expressive
- anti unification