Polynomial equality testing for terms with shared substructures
- Sharing of substructures like subterms and subcontexts in terms is a common method for space-efficient representation of terms, which allows for example to represent exponentially large terms in polynomial space, or to represent terms with iterated substructures in a compact form. We present singleton tree grammars as a general formalism for the treatment of sharing in terms. Singleton tree grammars (STG) are recursion-free context-free tree grammars without alternatives for non-terminals and at most unary second-order nonterminals. STGs generalize Plandowski's singleton context free grammars to terms (trees). We show that the test, whether two different nonterminals in an STG generate the same term can be done in polynomial time, which implies that the equality test of terms with shared terms and contexts, where composition of contexts is permitted, can be done in polynomial time in the size of the representation. This will allow polynomial-time algorithms for terms exploiting sharing. We hope that this technique will lead to improved upper complexity bounds for variants of second order unification algorithms, in particular for variants of context unification and bounded second order unification.
Verfasserangaben: | Manfred Schmidt-SchaußORCiDGND |
---|---|
URN: | urn:nbn:de:hebis:30-21699 |
URL: | http://www.ki.informatik.uni-frankfurt.de/papers/schauss/context-cfg-svIB.pdf |
Titel des übergeordneten Werkes (Deutsch): | Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 21 |
Schriftenreihe (Bandnummer): | Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik (21) |
Verlag: | Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology |
Verlagsort: | Frankfurt [am Main] |
Dokumentart: | Arbeitspapier |
Sprache: | Englisch |
Jahr der Fertigstellung: | 2005 |
Jahr der Erstveröffentlichung: | 2005 |
Veröffentlichende Institution: | Universitätsbibliothek Johann Christian Senckenberg |
Datum der Freischaltung: | 21.11.2005 |
Freies Schlagwort / Tag: | Baumgrammatiken; Polynomielles Wortproblem polynomial word problem; sharing; tree grammars |
GND-Schlagwort: | Wortproblem |
Seitenzahl: | 28 |
Letzte Seite: | 28 |
HeBIS-PPN: | 344376672 |
Institute: | Informatik und Mathematik / Informatik |
DDC-Klassifikation: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
Lizenz (Deutsch): | Deutsches Urheberrecht |