A categorical approach to unification of generalised terms

uncategorised

Authors

Patrik Eklund

Maria A. Galán

Jesús Medina

Manuel Ojeda-Aciego

Agustín Valverde

Published

1 January 2002

Publication details

Unification in Non-Classical Logics, {UNCL} 2002, {ICALP} 2002 Satellite Workshop, M{'{a}}laga, Spain, July 12-13, 2002 , Electronic Notes in Theoretical Computer Science vol. 66, pages 41–51.

Links

Abstract

Unification of generalised terms in a many-valued setting involves considerations for equalities in the sense of similarity degrees between operators and thus similarities between terms. Further, allowing for substitutions of variables with powersets of terms requires ‘flattening’ operators for handling composition of variable substitutions. These techniques are available when using powerset functors composed with the term functor so that this composition of functors is extendable to a monad. In this paper we provide a framework for unification of such generalised terms.

Citation

Please, cite this work as:

[Ekl+02] P. Eklund, M. A. Galán, J. Medina, et al. “A categorical approach to unification of generalised terms”. In: Unification in Non-Classical Logics, UNCL 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002. Ed. by P. Eklund and M. Ojeda-Aciego. Vol. 66. Electronic Notes in Theoretical Computer Science 5. Elsevier, 2002, pp. 41-51. DOI: 10.1016/S1571-0661(04)80513-9. URL: https://doi.org/10.1016/S1571-0661(04)80513-9.

BibTeX

@InProceedings{Eklund2002,
     author = {Patrik Eklund and Maria A. Gal{’a}n and Jes{’u}s Medina and Manuel Ojeda-Aciego and Agust'Valverde},
     booktitle = {Unification in Non-Classical Logics, {UNCL} 2002, {ICALP} 2002 Satellite Workshop, M{'{a}}laga, Spain, July 12-13, 2002},
     title = {A categorical approach to unification of generalised terms},
     year = {2002},
     editor = {Patrik Eklund and Manuel Ojeda-Aciego},
     number = {5},
     pages = {41–51},
     publisher = {Elsevier},
     series = {Electronic Notes in Theoretical Computer Science},
     volume = {66},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/journals/entcs/EklundGMOV02.bib},
     doi = {10.1016/S1571-0661(04)80513-9},
     timestamp = {Tue, 06 Dec 2022 10:41:49 +0100},
     url = {https://doi.org/10.1016/S1571-0661(04)80513-9},
}

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

Citations
CrossRef - Citation Indexes: 7
Scopus - Citation Indexes: 8

Captures
Mendeley - Readers: 8

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Papers citing this work

The following is a non-exhaustive list of papers that cite this work:

[1] P. Eklund. “Early diagnosis of cognitive disorder based on ground categories for decision support structures”. In: 2009 IEEE International Conference on Fuzzy Systems. IEEE, Aug. 2009, p. 997–1002. DOI: 10.1109/fuzzy.2009.5277098. URL: http://dx.doi.org/10.1109/fuzzy.2009.5277098.

[2] P. Eklund and R. Helgesson. “Composing Partially Ordered Monads”. In: Relations and Kleene Algebra in Computer Science. Springer Berlin Heidelberg, 2009, p. 88–102. ISBN: 9783642046391. DOI: 10.1007/978-3-642-04639-1_7. URL: http://dx.doi.org/10.1007/978-3-642-04639-1_7.

[3] W. Kahl. “Determinisation of relational substitutions in ordered categories with domain”. In: The Journal of Logic and Algebraic Programming 79.8 (Nov. 2010), p. 812–829. ISSN: 1567-8326. DOI: 10.1016/j.jlap.2010.07.017. URL: http://dx.doi.org/10.1016/j.jlap.2010.07.017.

[4] A. V. Zhozhikashvili. “Monads for the formalization of a pattern matching procedure”. In: Programming and Computer Software 40.3 (May. 2014), p. 117–127. ISSN: 1608-3261. DOI: 10.1134/s0361768814030074. URL: http://dx.doi.org/10.1134/s0361768814030074.