Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants.
Emanuel KieronskiLidia TenderaPublished in: ACM Trans. Comput. Log. (2018)
Keyphrases
- guarded fragment
- satisfiability problem
- transitive closure
- first order logic
- expressive power
- np complete
- search algorithm
- conjunctive queries
- temporal logic
- sat problem
- knowledge representation
- propositional logic
- query language
- relational algebra
- query evaluation
- directed acyclic graph
- special case
- artificial intelligence
- computational complexity
- database systems