PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Generic Expression Hardness Results for Primitive Positive Formula Comparison.
Simone Bova, Hubert Ming Chen and Matthew Valeriote
ICALP 2011 Volume ICALP 2011, 2011.

Abstract

We study the expression complexity of two basic problems involving the compar- ison of primitive positive formulas: equivalence and containment. In particular, we study the complexity of these problems relative to nite 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.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8838
Deposited By:Hubert Ming Chen
Deposited On:21 February 2012