Finite satisfiability for two-variable, first-order logic with one transitive relation is decidable.
Ian Pratt-HartmannPublished in: Math. Log. Q. (2018)
Keyphrases
- guarded fragment
- first order logic
- satisfiability problem
- expressive power
- transitive closure
- conjunctive queries
- knowledge representation
- propositional logic
- theorem prover
- markov networks
- inference rules
- relational algebra
- theorem proving
- probabilistic reasoning
- temporal logic
- inductive logic programming
- representation language
- np complete
- quantifier elimination
- probabilistic graphical models
- constraint databases
- data complexity
- markov logic
- directed acyclic graph
- logical rules
- dl lite
- horn clauses
- sat problem
- machine learning
- query language