Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable
Manfred KufleitnerAlexander LauserPublished in: CoRR (2012)
Keyphrases
- first order logic
- quantifier elimination
- expressive power
- propositional logic
- transitive closure
- probabilistic reasoning
- theorem proving
- knowledge representation
- inference rules
- probabilistic graphical models
- inductive logic programming
- theorem prover
- representation language
- markov networks
- quantifier free
- markov logic
- function symbols
- horn clauses
- constraint databases
- constraint satisfaction problems
- artificial intelligence
- relational algebra
- markov logic networks
- np hard
- expert systems