Completeness theorems for first-order logic analysed in constructive type theory.
Yannick ForsterDominik KirstDominik WehrPublished in: J. Log. Comput. (2021)
Keyphrases
- first order logic
- expressive power
- set theory
- quantifier free
- theorem proving
- propositional logic
- knowledge representation
- classical first order logic
- theorem prover
- inference rules
- probabilistic reasoning
- inductive logic programming
- representation language
- transitive closure
- markov networks
- probabilistic graphical models
- predicate calculus
- relational algebra
- markov logic networks
- quantifier elimination
- horn clauses
- logical rules
- markov logic
- proof procedure
- highly expressive
- anti unification
- search algorithm