Regular Patterns in Second-Order Unification - Laboratoire d'informatique de l'école polytechnique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Regular Patterns in Second-Order Unification

Résumé

The second-order unification problem is undecidable. While unification procedures, like Huet's pre-unification, terminate with success on unifiable problems, they might not terminate on non-unifiable ones. There are several results which decides the unification problem for monadic signatures. These results are based on the regular structure of the solutions of problems over monadic signatures. In this paper we describe an enhancement to Huet's pre-unification procedure for arbitrary second-order signatures which, in some cases, terminates on problem on which the original pre-unification procedure fails to terminate. This is obtained by identifying regular patterns in non-regular partial solutions.
paper.pdf (335.26 Ko) Télécharger le fichier

Dates et versions

hal-01242215 , version 1 (11-12-2015)

Identifiants

Citer

Tomer Libal. Regular Patterns in Second-Order Unification. Proceedings of CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany, Aug 2015, Berlin, Germany. ⟨10.1007/978-3-319-21401-6_38⟩. ⟨hal-01242215⟩
241 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More