Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/unification-and-matching-on-compressed-terms-ls6Qyik32O
References (54)
-
Wojciech Plandowski (1994)
Testing Equivalence of Morphisms on Context-Free Languages -
Then, for every non-terminal N ′ of G it holds that Vdepth -
M. Schmidt-Schauß (2005)
Polynomial Equality Testing for Terms with Shared Substructures -
Jordi Levy, M. Schmidt-Schauß, Mateu Villaret (2006)
Stratified Context Unification Is NP-Complete -
(2007)
XML Path Language (XPath) Version -
M. Schmidt-Schauß, K. Schulz (1998)
On the Exponent of Periodicity of Minimal Solutions of Context Equation -
Let G be an STG, let N be a non-terminal of G, let V be a λset for G, let k be a natural number satisfying k ≤ |Pre -
Wojciech Plandowski (1995)
The Complexity of the Morphism Equivalence Problem for Context-Free Languages -
H. Comon (1997)
Tree automata techniques and applications -
S. Lasota, W. Rytter (2006)
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes -
Jordi Levy, M. Schmidt-Schauß, Mateu Villaret (2006)
Bounded Second-Order Unification Is NP-Complete -
P. Downey, R. Sethi, R. Tarjan (1980)
Variations on the Common Subexpression ProblemJournal of the ACM (JACM), 27
-
Peter Graf (1995)
Substitution Tree Indexing -
Adrià Gascón, Guillem Godoy, M. Schmidt-Schauß, A. Tiwari (2010)
Context unification with one context variableJ. Symb. Comput., 45
-
Y. Lifshits (2007)
Processing Compressed Texts: A Tractability Border -
S. Maneth, N. Mihaylov, S. Sakr (2008)
XML Tree Structure Compression2008 19th International Workshop on Database and Expert Systems Applications
-
F. Baader, Wayne Snyder (1990)
Unification Theory -
While s and t are different do: Look for the first position k -
Sumit Gulwani, A. Tiwari (2007)
Computing Procedure Summaries for Interprocedural Analysis -
Unification Algorithm of STG-Compressed Terms -
Markus Lohrey (2006)
Word Problems and Membership Problems on Compressed WordsSIAM J. Comput., 35
-
M. Schmidt-Schauß, Jürgen Stuber (2002)
The Complexity of Linear and Stratified Context Matching ProblemsTheory of Computing Systems, 37
-
A 2 )) and Vdepth G (A 2 ) = Vdepth G ′ (A 2 ), it also holds that -
Adrià Gascón, Guillem Godoy, M. Schmidt-Schauß (2008)
Context Matching for Compressed Terms2008 23rd Annual IEEE Symposium on Logic in Computer Science
-
I. Ramakrishnan, R. Sekar, A. Voronkov (1995)
Term Indexing -
(2010)
ACM Transactions on Computational Logic Unification and Matching on Compressed Terms · -
G. Busatto, Markus Lohrey, S. Maneth (2005)
Efficient Memory Representation of XML Documents -
P. Berman, Marek Karpinski, L. Larmore, Wojciech Plandowski, W. Rytter (1997)
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts -
Marek Karpinski, W. Rytter, A. Shinohara (1995)
Pattern-Matching for Strings with Short DescriptionsElectron. Colloquium Comput. Complex., TR95
-
M. Paterson, M. Wegman (1976)
Linear unificationJ. Comput. Syst. Sci., 16
-
M. Schmidt-Schauß, G. Schnitger (2012)
Fast equality test for straight-line compressed stringsInf. Process. Lett., 112
-
J. Ziv, A. Lempel (1977)
A universal algorithm for sequential data compressionIEEE Trans. Inf. Theory, 23
-
Markus Lohrey, S. Maneth, M. Schmidt-Schauß (2009)
Parameter Reduction in Grammar-Compressed Trees -
Wojciech Plandowski, W. Rytter (1999)
Complexity of Language Recognition Problems for Compressed Words -
M. Schmidt-Schauß, K. Schulz (1999)
Solvability of Context Equations with Two Context Variables is DecidableJ. Symb. Comput., 33
-
J. Cheney (1998)
FIRST-ORDER TERM COMPRESSION: TECHNIQUES AND APPLICATIONS -
A. Martelli, U. Montanari (1982)
An Efficient Unification AlgorithmACM Trans. Program. Lang. Syst., 4
-
L. Gąsieniec, Marek Karpinski, Wojciech Plandowski, W. Rytter (1996)
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract) -
Dan Benanav, D. Kapur, P. Narendran (1985)
Complexity of Matching Problems -
(2011)
Article 26, Publication date -
Adrià Gascón, Guillem Godoy, M. Schmidt-Schauß (2009)
Unification with Singleton Tree Grammars -
Jordi Levy, M. Schmidt-Schauß, Mateu Villaret (2008)
The Complexity of Monadic Second-Order UnificationSIAM J. Comput., 38
-
J. Robinson (1965)
A Machine-Oriented Logic Based on the Resolution PrincipleJ. ACM, 12
-
Jordi Levy, M. Schmidt-Schauß, Mateu Villaret (2004)
Monadic Second-Order Unification Is NP-Complete -
B. Genest, A. Muscholl (2002)
Pattern Matching and Membership for Hierarchical Message Sequence ChartsTheory of Computing Systems, 42
-
G. Busatto, Markus Lohrey, S. Maneth (2008)
Efficient memory representation of XML document treesInf. Syst., 33
-
Masahiro Hirao, A. Shinohara, M. Takeda, S. Arikawa (2000)
Fully compressed pattern matching algorithm for balanced straight-line programsProceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000
-
Markus Lohrey, S. Maneth (2006)
The complexity of tree automata and XPath on grammar-compressed treesTheor. Comput. Sci., 363
-
J. Siekmann (1986)
Unification theoryDecis. Support Syst., 6
-
L. Gąsieniec, Marek Karpinski, Wojciech Plandowski, W. Rytter (1996)
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract) -
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg (1997)
A Uniform Approach to Underspecification and Parallelism -
L. Gąsieniec, Marek Karpinski, Wojciech Plandowski, W. Rytter (1996)
Efficient algorithms for Lempel-Ziv encoding -
G. Gottlob, Christoph Koch, K. Schulz (2004)
Conjunctive queries over trees -
Jordi Levy, M. Schmidt-Schauß, Mateu Villaret (2010)
On the complexity of Bounded Second-Order Unification and Stratified Context UnificationLog. J. IGPL, 19
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2011 by ACM Inc.
- ISSN
- 1529-3785
- DOI
- 10.1145/1970398.1970402
- Publisher site
- See Article on Publisher Site
Abstract
Uni cation and Matching on Compressed Terms ` ADRIA GASCON and GUILLEM GODOY, Universitat Polit` cnica de Catalunya e MANFRED SCHMIDT-SCHAUSS, Goethe-Universitat Term uni cation 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 (STGAs), 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 ef ciently simulated. The present article is the result of an investigation on term uni cation 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 xed 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 rst-order uni cation and matching polynomial time algorithms are presented, each of them improving previous results for those problems. Categories and Subject Descriptors: F.4.1 [Mathematical Logic and
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jul 1, 2011