On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations.
Emanuel KieronskiLidia TenderaPublished in: LICS (2009)
Keyphrases
- first order logic
- equivalence relation
- guarded fragment
- propositional logic
- expressive power
- transitive closure
- inference rules
- binary relations
- theorem proving
- rough set theory
- theorem prover
- knowledge representation
- relational algebra
- davis putnam logemann loveland
- rough sets
- numerical data
- granular computing
- satisfiability problem
- concept lattice
- quantifier elimination
- knowledge base
- model checking
- decision rules
- boolean formula
- query processing
- computational complexity