The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable.
Ian Pratt-HartmannPublished in: CoRR (2017)
Keyphrases
- guarded fragment
- satisfiability problem
- first order logic
- np complete
- transitive closure
- temporal logic
- expressive power
- search algorithm
- phase transition
- sat problem
- pspace complete
- inference rules
- decision procedures
- theorem proving
- sat instances
- max sat
- mazurkiewicz traces
- model checking
- horn clauses
- probabilistic reasoning
- propositional logic
- np hard
- machine learning