The quantifier complexity of polynomial-size iterated definitions in first-order logic.
Samuel R. BussAlan S. JohnsonPublished in: Math. Log. Q. (2010)
Keyphrases
- first order logic
- polynomial size
- quantifier elimination
- exponential size
- expressive power
- propositional logic
- knowledge representation
- dnf formulas
- inductive logic programming
- transitive closure
- boolean functions
- incomplete information
- horn clauses
- knowledge compilation
- bounded treewidth
- decision problems
- machine learning
- xml data
- computational complexity
- artificial intelligence