Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable.
Manfred KufleitnerAlexander LauserPublished in: STACS (2013)
Keyphrases
- first order logic
- quantifier elimination
- expressive power
- propositional logic
- inference rules
- theorem proving
- probabilistic reasoning
- inductive logic programming
- markov networks
- transitive closure
- knowledge representation
- theorem prover
- function symbols
- horn clauses
- relational algebra
- representation language
- probabilistic graphical models
- quantifier free
- constraint databases
- markov logic
- fuzzy measures
- constraint satisfaction
- query language
- logical rules
- np hard
- machine learning