On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards.
Emanuel KieronskiLidia TenderaPublished in: LPAR (2007)
Keyphrases
- guarded fragment
- satisfiability problem
- transitive closure
- expressive power
- first order logic
- constraint databases
- np complete
- temporal logic
- phase transition
- query language
- search algorithm
- databases
- propositional logic
- knowledge representation
- relational algebra
- geographic information systems
- computational complexity
- optimal solution