English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/131941
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
DC FieldValueLanguage
dc.contributor.authorLevy, Jordi-
dc.identifieruri: http://www.loria.fr/~ringeiss/UNIF2014/papers/invited_paper_2.pdf-
dc.identifier.citationUNIF 2014, The 28th International Workshop on Unification, July 13, 2014. Vienna, Austria a FLoC workshop hosted by RTA-TLCA and IJCAR-
dc.description.abstractSecond-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.-
dc.titleOn the Limits of Second-Order Unification-
dc.typecomunicación de congreso-
dc.description.versionPeer Reviewed-
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
UNIF2014.pdf155,59 kBUnknownView/Open
Show simple item record

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