Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy.
Nerio BorgesEdwin PinPublished in: Log. J. IGPL (2019)
Keyphrases
- first order logic
- expressive power
- theorem proving
- propositional logic
- inference rules
- probabilistic reasoning
- lower level
- transitive closure
- knowledge representation
- higher level
- representation language
- theorem prover
- markov networks
- probabilistic graphical models
- inductive logic programming
- relational algebra
- horn clauses
- markov logic networks
- quantifier elimination
- constraint databases
- logical rules
- monadic second order logic