Unification and Matching on Compressed Terms
Authors:
- Adrià GascónAGAdrià Gascón
- Guillem GodoyGGGuillem Godoy
- Manfred Schmidt-SchaußMSManfred Schmidt-Schauß
Preprint
Abstract
Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called Singleton Tree Grammars (STG), have recently drawn considerable attention. Using STGs, terms of exponential size and height can be represented in linear space. Furthermore, the term representation by directed acyclic graphs (dags) can be efficiently simulated. The present paper is the result of an investigation on term unification and matching when the terms given as input are represented using different compression mechanisms for terms such as dags and Singleton Tree Grammars. We describe a polynomial time algorithm for context matching with dags, when the number of different context variables is fixed for the problem. For the same problem, NP-completeness is obtained when the terms are represented using the more general formalism of Singleton Tree Grammars. For first-order unification and matching polynomial time algorithms are presented, each of them improving previous results for those problems.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Fast equality test for straight-line compressed stringsInformation Processing Letters, 2012
- Context unification with one context variableJournal of Symbolic Computation, 2010
- Unification with Singleton Tree Grammars2009
- XML Tree Structure Compression2008
- Processing Compressed Texts: A Tractability Border2007
- The Complexity of Linear and Stratified Context Matching ProblemsTheory of Computing Systems, 2004
- Fully compressed pattern matching algorithm for balanced straight-line programs2002
- On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional TextsJournal of Computer and System Sciences, 2002
- Pattern-matching for strings with short descriptionsLecture Notes in Computer Science, 1995
- Linear unificationJournal of Computer and System Sciences, 1978