A proof of completeness for continuous first-order logic.
Arthur Paul PedersenItay Ben-YaacovPublished in: J. Symb. Log. (2010)
Keyphrases
- expert systems
- first order logic
- theorem proving
- theorem prover
- knowledge representation
- expressive power
- logical rules
- proof procedure
- propositional logic
- inference rules
- classical first order logic
- probabilistic reasoning
- representation language
- relational algebra
- predicate calculus
- inductive logic programming
- markov networks
- transitive closure
- probabilistic graphical models
- term rewriting
- markov logic
- horn clauses
- artificial intelligence
- constraint databases
- markov logic networks
- quantifier elimination
- relational calculus
- np complete
- closure operator
- logic programming
- anti unification