http://repositorio2.unb.br/jspui/handle/10482/12419| Fichier | Description | Taille | Format | |
|---|---|---|---|---|
| ARTIGO_UnificationModuloPresburg.pdf | 537,26 kB | Adobe PDF | Voir/Ouvrir |
| Titre: | Unification modulo Presburger Arithmetic and other decidable theories |
| Auteur(s): | Ayala-Rincón, Mauricio Araújo, Ivan Eid Tavares de |
| Assunto:: | Linguagem de programação (Computadores) Modulo Presburger Arithmetic Automação |
| Date de publication: | 8-mar-2013 |
| Référence bibliographique: | AYALA RICÓN, Maurício; ARAÚJO, Ivan E. Tavares de. Unification modulo Presburger Arithmetic and other decidable theories. Revista Colombiana de Computación, Bucaramanga, v. 2, n.2, p. 7-19, 2002. Disponível em: <http://revistas.unab.edu.co/index.php?journal=rcc&page=article&op=view&path%5B%5D=1112&path%5B%5D=1083>. Acesso em: 08 mar. 2013. |
| Résumé: | We present a general unification algorithm modulo Presburger Arithmetic for a restricted class of modularly specified theories where function symbols of the target theory have non arithmetic codomain sorts. Additionally, we comment on conditions guaranteeing decidability of matching and unification problems modulo more general theories than the arithmetic ones, which appear when automated deduction is implemented by combining conditional rewriting techniques and decision algorithms for built-in predicates. |
| metadata.dc.description.unidade: | Faculdade de Ciência da Informação (FCI) |
| Licença:: | Revista Colombiana de Computación - Esta obra está licenciada sob uma Licença Creative Commons (Attribution 3.0 Unported (CC BY 3.0)). Fonte: http://revistas.unab.edu.co/index.php?journal=rcc&page=article&op=view&path%5B%5D=1088. Acesso em: 08 mar. 2013. |
| Collection(s) : | Artigos publicados em periódicos e afins |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.