Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
66.403 UPC academic works
You are here:
View Item 
  •   DSpace Home
  • Treballs acadèmics
  • Màsters oficials
  • Master in Computing (Pla 2006)
  • View Item
  •   DSpace Home
  • Treballs acadèmics
  • Màsters oficials
  • Master in Computing (Pla 2006)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Unification on Compressed Terms

Thumbnail
View/Open
Gascon.pdf (306,6Kb)
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2099.1/7712

Show full item record
Gascón, Adrià
Tutor / directorGodoy Balil, GuillemMés informacióMés informació
Document typeMaster thesis
Date2009-09
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
First-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
SubjectsData compression (Computer science), Dades Compressió (Informàtica)
DegreeMÀSTER UNIVERSITARI EN COMPUTACIÓ (Pla 2006)
URIhttp://hdl.handle.net/2099.1/7712
Collections
  • Màsters oficials - Master in Computing (Pla 2006) [85]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Gascon.pdf306,6KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina