English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160942
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Monadic second-order unification Is NP-complete

AuthorsLevy, Jordi ; Schmidt-Schauss, Manfred; Villaret, Mateu
KeywordsSecond-order matching
NP complete
Second orders
Issue Date2004
CitationRewriting Techniques and Applications: 15th International Conference, RTA 2004. Proceedings. LNCS 3091: 55- 69 (2004)
AbstractMonadic Second-Order Unification (MSOU) 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. We also prove that Monadic Second-Order Matching is also NP-complete. © Springer-Verlag 2004.
Identifiersdoi: 10.1007/978-3-540-25979-4_4
issn: 0302-9743
isbn: 978-3-540-22153-1
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
RTA2004_LNCS3091_55-69.pdf148,95 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.