Generic Expression Hardness Results for Primitive Positive Formula Comparison [chapter]

Simone Bova, Hubie Chen, Matthew Valeriote
2011 Lecture Notes in Computer Science  
We study the expression complexity of two basic problems involving the comparison of primitive positive formulas: equivalence and containment. In particular, we study the complexity of these problems relative to finite relational structures. We present two generic hardness results for the studied problems, and discuss evidence that they are optimal and yield, for each of the problems, a complexity trichotomy.
doi:10.1007/978-3-642-22012-8_27 fatcat:sgyanmkrubbo3m3diy5r23sepq