Results 1 
2 of
2
Onecontext Unification with STGCompressed Terms is in NP
, 2012
"... Onecontext unification is an extension of firstorder term unification in which a variable of arity one standing for a context may occur in the input terms. This problem arises in areas like program analysis, term rewriting and XML processing and is known to be solvable in nondeterministic polynomi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Onecontext unification is an extension of firstorder term unification in which a variable of arity one standing for a context may occur in the input terms. This problem arises in areas like program analysis, term rewriting and XML processing and is known to be solvable in nondeterministic polynomial time. We prove that this problem can be solved in nondeterministic polynomial time also when the input is compressed using Singleton Tree Grammars (STG’s). STG’s are a grammarbased compression method for terms that generalizes the directed acyclic graph representation. They have been recently considered as an efficient inmemory representation for large terms, since several operations on terms can be performed efficiently on their STG representation without a prior decompression.
Congruence Closure of Compressed Terms in Polynomial Time
, 2011
"... The wordproblem for a finite set of equational axioms between ground terms is the question whether for terms s, t the equation s = t is a consequence. We consider this problem under grammar based compression of terms, in particular compression with singleton tree grammars (STGs) and with directed ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The wordproblem for a finite set of equational axioms between ground terms is the question whether for terms s, t the equation s = t is a consequence. We consider this problem under grammar based compression of terms, in particular compression with singleton tree grammars (STGs) and with directed acyclic graphs (DAGs) as a special case. We show that given a DAGcompressed ground and reduced term rewriting system T, the Tnormal form of an STGcompressed term s can be computed in polynomial time, and hence the Tword problem can be solved in polynomial time. This implies that the word problem of STGcompressed terms w.r.t. a set of DAGcompressed ground equations can be decided in polynomial time. If the ground term rewriting system (gTRS) T is STGcompressed, we show NPhardness of Tnormalform computation. For compressed, reduced gTRSs we show a PSPACE upper bound on the complexity of the normal form computation of STGcompressed terms. Also special cases are considered and a prototypical implementation is presented.