The Complexity of Monadic Second-Order Unification

Authors:
Jordi Levy;Manfred Schmidt-Schauß;Mateu Villaret
Affiliations:
levy@iiia.csic.es and http://www.iiia.csic.es/$\'!_{^{\'sim}}\'!$levy;schauss@ki.informatik.uni-frankfurt.de and http://www.ki.informatik.uni-frankfurt.de/ persons/schauss/schauss.html;villaret@ima.udg.es and http://ima.udg.es/$\'!_{^{\'sim}}\'!$villaret
Venue:
SIAM Journal on Computing
Year:
2008

Citing 0
Cited 4

Unification and matching on compressed terms

ACM Transactions on Computational Logic (TOCL)
Parameter reduction and automata evaluation for grammar-compressed trees

Journal of Computer and System Sciences
New algorithms for unification modulo one-sided distributivity and its variants

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
XML tree structure compression using RePair

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding whether a set of monadic equations has a unifier is NP-complete, where we use the technique of compressing solutions using singleton context-free grammars. We prove that monadic second-order matching is also NP-complete.