Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras.
Pawel M. IdziakPiotr KawalekJacek KrzaczkowskiPublished in: MFCS (2018)
Keyphrases
- expressive power
- guarded fragment
- relation algebra
- computational properties
- first order logic
- query language
- satisfiability problem
- np complete
- data complexity
- propositional logic
- transitive closure
- relational algebra
- computational complexity
- relational calculus
- phase transition
- recursive queries
- search algorithm
- knowledge representation
- user defined aggregates