English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/131941
Compartir / Impacto:
Estadísticas
Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Título

On the Limits of Second-Order Unification

AutorLevy, Jordi
Fecha de publicación13-jul-2014
CitaciónUNIF 2014, The 28th International Workshop on Unification, July 13, 2014. Vienna, Austria a FLoC workshop hosted by RTA-TLCA and IJCAR
ResumenSecond-Order Unification is a problem that naturally arises when applying automated deduction techniques with variables denoting predicates. The problem is undecidable, but a considerable effort has been made in order to find decidable fragments, and understand the deep reasons of its complexity. Two variants of the problem, Bounded Second-Order Unification and Linear Second-Order Unification ¿where the use of bound variables in the instantiations is restricted¿, have been extensively studied in the last two decades. In this paper we summarize some decidability/undecidability/complexity results, trying to focus on those that could be more interesting for a wider audience, and involving less technical details.
URIhttp://hdl.handle.net/10261/131941
Identificadoresuri: http://www.loria.fr/~ringeiss/UNIF2014/papers/invited_paper_2.pdf
Aparece en las colecciones: (IIIA) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
UNIF2014.pdf155,59 kBUnknownVisualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.