A simple proof of the polylog counting ability of first-order logic: guest column.
Arnaud DurandClemens LautemannMalika MorePublished in: SIGACT News (2007)
Keyphrases
- first order logic
- theorem proving
- theorem prover
- expressive power
- propositional logic
- inference rules
- logical rules
- inductive logic programming
- proof procedure
- probabilistic graphical models
- knowledge representation
- relational algebra
- markov networks
- representation language
- predicate calculus
- transitive closure
- classical first order logic
- probabilistic reasoning
- artificial intelligence
- term rewriting
- machine learning
- markov logic networks
- data mining
- markov logic
- quantifier free
- constraint databases
- function symbols
- probabilistic model