Mostrar el registro sencillo del ítem

Módulo de unificación aritmética pre-hamburguesa y otras teorías decidibles

dc.contributor.authorAyala Rincón, Mauriciospa
dc.contributor.authorTavares Araújo, Ivan E.spa
dc.date.accessioned2020-10-27T00:21:33Z
dc.date.available2020-10-27T00:21:33Z
dc.date.issued2001-12-01
dc.identifier.issn2539-2115
dc.identifier.issn1657-2831
dc.identifier.urihttp://hdl.handle.net/20.500.12749/9069
dc.description.abstractPresentamos un algoritmo de unificación general módulo Presburger Arithmetic para una clase restringida de teorías especificadas modularmente donde los símbolos de función de la teoría objetivo tienen clases de codominio no aritméticas. Además, comentamos las condiciones que garantizan la decidibilidad de problemas de emparejamiento y unificación módulo teorías más generales que las aritméticas, que aparecen cuando se implementa la deducción automática combinando técnicas de reescritura condicional y algoritmos de decisión para predicados incorporados.spa
dc.format.mimetypeapplication/pdfspa
dc.language.isospaspa
dc.publisherUniversidad Autónoma de Bucaramanga UNAB
dc.relationhttps://revistas.unab.edu.co/index.php/rcc/article/view/1112/1083
dc.relation.urihttps://revistas.unab.edu.co/index.php/rcc/article/view/1112
dc.rightsDerechos de autor 2001 Revista Colombiana de Computación
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/co/
dc.sourceRevista Colombiana de Computación; Vol. 2 Núm. 2 (2001): Revista Colombiana de Computación; 1-14
dc.subjectInnovaciones tecnológicas
dc.subjectCiencia de los computadores
dc.subjectDesarrollo de tecnología
dc.subjectIngeniería de sistemas
dc.subjectInvestigaciones
dc.subjectTecnologías de la información y las comunicaciones
dc.subjectTIC´s
dc.titleMódulo de unificación aritmética pre-hamburguesa y otras teorías decidibles
dc.title.translatedUnification modulo presburger arithmetic and other decidable theories
dc.type.driverinfo:eu-repo/semantics/article
dc.type.localArtículospa
dc.type.coarhttp://purl.org/coar/resource_type/c_7a1f
dc.subject.keywordsTechnological innovationseng
dc.subject.keywordsComputer scienceeng
dc.subject.keywordsTechnology developmenteng
dc.subject.keywordsSystems engineeringeng
dc.subject.keywordsInvestigationseng
dc.subject.keywordsInformation and communication technologieseng
dc.subject.keywordsICT'seng
dc.subject.keywordsAlgebraic specificationeng
dc.subject.keywordsEquational unificationeng
dc.subject.keywordsAlgebraic specificationeng
dc.identifier.instnameinstname:Universidad Autónoma de Bucaramanga UNABspa
dc.type.hasversioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.relation.referencesM. Ayala-Rinc on. Expressiveness of Conditional Equational Systems with Builtin Predicates. PhD thesis, Universit at Kaiserslautern, Kaiserslautern (Germany), December 1993.
dc.relation.referencesM. Ayala-Rinc on. Church-Rosser Property for Conditional Rewriting Systems with Built-in Predicates as Premises. In D. M. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2, Studies on Logic and Computation, 7, chapter 2, pages 17{38. Research Studies Press/Wiley, 2000.
dc.relation.referencesM. Ayala-Rinc on and L. M. R. Gadelha. Some Applications of (Semi-)Decision Algorithms for Presburger Arithmetic in Automated Deduction based on Rewriting Techniques. La Revista de La Sociedad Chilena de Ciencia de la Computaci on, 2(1):14{23, 1997.
dc.relation.referencesJ. Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the foundations of Mathematics. North-Holland, 1977.
dc.relation.referencesF. Baader and W. Nutt. Combination Problems for Commutative/Monoidal Theories or How Algebra Can Help in Equational Uni cation. Journal of Applicable Algebra in Engineering, Communication and Computing, 7(4):309{337, 1996.
dc.relation.referencesF. Baader and J. H. Siekmann. Uni cation Theory. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Arti cial Intel ligence and Logic Programming, pages 41{125. Oxford University Press, 1994.
dc.relation.referencesF. Baader and K. U. Schulz. Uni cation in the Union of Disjoint Equational Theories: Combining Decision Procedures. Journal of Symbolic Computation, 21:211{243, 1996.
dc.relation.referencesF. Baader and W. Snyder. Uni cation Theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers, 1999.
dc.relation.referencesD. C. Cooper. Theorem Proving in Arithmetic without Multiplication. Machine Intel ligence, 7:91{99, 1972.
dc.relation.referencesI. E. T. de Ara ujo and M. Ayala-Rinc on. An Algorithm for General Uni cation Modulo Presburger Arithmetic. In I Brazilian Workshop on Formal Methods, Porto Alegre, Brazil, pages 146{151, October 1998.
dc.relation.referencesN. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume 2, chapte
dc.relation.referencesC. Hosono and Y. Ikeda. A Formal Derivation of the Theory SA. Theoretical Computer Science, 127:1{23, 1994.
dc.relation.referencesY. Ikeda, K. Tomita, and C. Hosono. A Programming Language SAMPL and its Interpreter. Unpublished document.
dc.relation.referencesD. Kapur and M. Subramaniam. New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. Journal of Automated Reasoning, 16(1/2), 1996.
dc.relation.referencesW. Nutt. Uni cation in Monoidal Theories is Solving Linear Equations over Semirings. Research Report RR-92-01, Deutsche Forschungszentrum f ur K unstliche Intelligenz, DFKI GmbH, Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1992.
dc.relation.referencesM. Presburger. Uber die V ollst andigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In 1. Kongres matematyk ow krajow slowia nskich, Warsaw, pages 92{101, 1929. In German.
dc.relation.referencesR. E. Shostak. On the SUP-INF Method for Proving Presburger Formulas. Journal of the Association for Computing Machinery, 24(4):529{543, October 1977.
dc.relation.referencesR. E. Shostak. A Practical Decision Procedure for Arithmetic with Function Symbols. Journal of the Association for Computing Machinery, 26(2):351{360, April 1979.
dc.contributor.googlescholarAyala Rincón, Mauricio [hd3UcpsAAAAJ]spa
dc.contributor.orcidAyala Rincón, Mauricio [0000-0003-0089-3905]spa
dc.contributor.orcidAyala Rincón, Mauricio [Mauricio-Ayala-Rincon]spa
dc.contributor.researchgateAyala Rincón, Mauricio [Mauricio-Ayala-Rincon]spa
dc.subject.lembInnovaciones tecnológicasspa
dc.subject.lembCiencias de la Computaciónspa
dc.subject.lembDesarrollo tecnológicospa
dc.subject.lembIngeniería de Sistemasspa
dc.subject.lembInvestigaciónspa
dc.identifier.repourlrepourl:https://repository.unab.edu.co
dc.description.abstractenglishWe present a general uni cation algorithm modulo Presburger Arithmetic for a re- stricted class of modularly speci ed theories where function symbols of the target theory have non arithmetic codomain sorts. Additionally, we comment on conditions guaran-teeing decidability of matching and uni cation 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 predi- cates.eng
dc.subject.proposalUnificación ecuacionalspa
dc.subject.proposalRazonamiento automatizadospa
dc.subject.proposalEspecificación algebraicaspa
dc.type.redcolhttp://purl.org/redcol/resource_type/CJournalArticle
dc.rights.creativecommonsAttribution-NonCommercial-ShareAlike 4.0 International*


Ficheros en el ítem

Thumbnail
Nombre:
Modulo de unificación aritmética ...
Tamaño:
537.2Kb
Formato:
PDF
Descripción:
Artículo
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-ShareAlike 4.0 International
Excepto si se señala otra cosa, la licencia del ítem se describe como Attribution-NonCommercial-ShareAlike 4.0 International