Mostrar el registro sencillo del ítem

dc.contributorGodoy Balil, Guillem
dc.contributor.authorGascón, Adrià
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.description.abstractFirst-order term unification is an essential concept in areas like functional and logic programming, automated deduction, deductive databases, artificial intelligence, information retrieval, compiler design, etc. We build upon recent developments in grammar-based compression mechanisms for terms and investigate algorithms for first-order unification and matching on compressed terms. We prove that the first-order unification of compressed terms is decidable in polynomial time, and also that a compressed representation of the most general unifier can be computed in polynomial time. Furthermore, we present a polynomial time algorithm for first-order matching on compressed terms. Both algorithms represent an improvement in time complexity over previous results [GGSS09, GGSS08]. We use several known results on the tree grammars used for compression, called singleton tree grammars (STG)s, like polynomial time computability of several subalgorithmms: certain grammar extensions, deciding equality of represented terms, and generating their preorder traversal. An innovation is a specialized depth of an STG that shows that unifiers can be represented in polynomial space
dc.publisherUniversitat Politècnica de Catalunya
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.lcshData compression (Computer science)
dc.subject.otherTerm unification
dc.titleUnification on Compressed Terms
dc.typeMaster thesis
dc.subject.lemacDades Compressió (Informàtica)
dc.rights.accessOpen Access
dc.audience.mediatorFacultat d'Informàtica de Barcelona

Ficheros en el ítem


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivs 3.0 Spain
Salvo que se indique lo contrario, los contenidos de esta obra estan sujetos a la licencia de Creative Commons : Reconocimiento-NoComercial-SinObraDerivada 3.0 España