Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory.
Yannick ForsterDominik KirstDominik WehrPublished in: LFCS (2020)
Keyphrases
- first order logic
- expressive power
- set theory
- quantifier free
- propositional logic
- inference rules
- theorem proving
- probabilistic reasoning
- inductive logic programming
- representation language
- knowledge representation
- transitive closure
- classical first order logic
- theorem prover
- markov networks
- probabilistic graphical models
- relational algebra
- markov logic networks
- quantifier elimination
- horn clauses
- relational structures
- proof procedure
- logical rules
- database
- markov logic
- type checking
- anti unification
- xml documents
- search algorithm