Publications related to matching, unification, and related techniques
This section contains papers that are related to solving equational constraints such as matching, unification, and related problems, as well as their applications. It includes both refereed publications and reports, but not edited books or volumes. Entries in this section may appear in the others as well.
Journal and conference papers
-
M. Ayala-Rincón,
M. Fernández,
G. Ferreira Silva,
T. Kutsia, and
D. Nantes-Sobrinho. Nominal AC-Matching.
In: C. Dubois and M. Kerber, editors. Proceedings of CICM 2023 – 16th Conference on Intelligent Computer Mathematics. Volume 14101 of Lecture Notes in Artificial Intelligence. Springer, 2023. 53–68. DOI: 10.1007/978-3-031-42753-4_4.
PDF, BibTeX, Best Paper Award. - M. Schmidt-Schauß, T. Kutsia, J. Levy, M. Villaret, Y. Kutz. Nominal Unification and Matching of Higher Order Expressions with Recursive Let. Fundamenta Informaticae, 185(3), 247–283, 2022. DOI: 10.3233/FI-222110.
PDF, BibTeX. -
B. Dundua, T. Kutsia, M. Rukhaia. Unranked Nominal Unification.
In: A. Özgün and Y. Zinova, editors. Proceedings of TbiLLC 2019 - 13th International Tbilisi Symposium on Logic, Language, and Computation. Volume 13206 of Lecture Notes in Computer Science. Springer, 2022. 279–296. DOI: 10.1007/978-3-030-98479-3_14.
PDF, BibTeX. -
T. Kutsia, C. Pau. Matching and Generalization Modulo Proximity and Tolerance Relations.
In: A. Özgün and Y. Zinova, editors. Proceedings of TbiLLC 2019 - 13th International Tbilisi Symposium on Logic, Language, and Computation. Volume 13206 of Lecture Notes in Computer Science. Springer, 2022. 323–342. DOI: 10.1007/978-3-030-98479-3_16.
PDF, BibTeX. -
C. Pau, T. Kutsia. Proximity-Based Unification and Matching for Fully Fuzzy Signatures.
In: Proceedings of FUZZ-IEEE 2021 - 30th IEEE International Conference on Fuzzy Systems. IEEE 2021. 1–6.
DOI: 10.1109/FUZZ45933.2021.9494438.
PDF, BibTeX. - B. Dundua, T. Kutsia, M. Marin. Variadic equational matching in associative and commutative theories. Journal of Symbolic Computation. 106, 78–109, 2021. DOI: 10.1016/j.jsc.2021.01.001.
PDF (with minor corresctions), PDF at the publisher's site, BibTeX. - I. Kotsireas, T. Kutsia, D. Simos. Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques. Annals of Mathematics and Artificial Intelligence. 88(1), 213–236, 2020. DOI: 10.1007/s10472-018-9607-9.
PDF, BibTeX. -
B. Dundua, T. Kutsia, M. Marin, C. Pau. Constraint solving over multiple similarity relations.
In: Z. M. Ariola, editor. Proceedings of the 5th International Conference on Formal Structures
for Computation and Deduction, FSCD 2020. Volume 167 of Leibniz International Proceedings in
Informatics (LIPIcs). Schloss Dagstuhl, 2020. 31:1–31:18.
PDF, BibTeX. - T. Kutsia, C. Pau. Solving proximity constraints. In: M. Gabbrielli, editor. Logic-Based Program Synthesis and Transformation - 29th International Symposium, LOPSTR 2019. Revised Selected Papers. October 8–10, 2019, Porto, Portugal. Vol. 12042 of Lecture Notes in Computer Science. Springer, 2019. 107–122. © Springer.
PDF, BibTeX. - B. Dundua, T. Kutsia, M. Marin. Variadic equational matching. In: C. Kaliszyk, E. Brady, A. Kohlhase, C. Sacerdoti Coen, editors. Intelligent Computer Mathematics - 12th International Conference, CICM 2019. July 9–12, 2019, Prague, Czech Republic. Vol. 11617 of Lecture Notes in Computer Science. Springer, 2019, 77–92. © Springer.
PDF, BibTeX. - S. Alves, B. Dundua, M. Florido, T. Kutsia. Pattern-based calculi with finitary matching. Logic Journal of the IGPL. 26(2):203–243, 2018. DOI: 10.1093/JIGPAL/jzx059.
PDF (with minor corrections), PDF from the publisher's page, BibTeX. - M. Schmidt-Schauß, T. Kutsia, J. Levy, M. Villaret. Nominal Unification of Higher Order Expressions with Recursive Let. In: M. V. Hermenegildo and P. Lopez-Garcia, editors. Proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016. Volume 10184 of Lecture Notes in Computer Science. Springer, 2017. 328–344. © Springer.
PDF, BibTeX. - I. Kotsireas, T. Kutsia, D. Simos. Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification. In: M. Fernández, editor, Proceedings of the 26th International Conference on Rewriting Techniques and Applications, RTA 2015. June 29–July 3, 2015, Warsaw, Poland. Vol. 36 of the Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl, 2015, 241–256.
PDF, BibTeX. - T Kutsia, M. Marin. Regular Expression Order-Sorted Unification and Matching. Journal of Symbolic Computation. 67:42–67, 2015. DOI: 10.1016/j.jsc.2014.08.002.
PDF, BibTeX. - T. Kutsia, M. Marin. Solving, Reasoning, and Programming in Common Logic. In: Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012. September 26–29, 2012, Timisoara, Romania. IEEE Computer Society. © IEEE, 2013, 119–126.
PDF, BibTeX. - T. Kutsia, M. Marin. Order-Sorted Unification with Regular Expression Sorts. In: Ch. Lynch, editor, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010. July 11–13, 2010, Edinburgh, UK. Volume 6 of the Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl, 2010, 193–208.
PDF, BibTeX. - T. Kutsia, J. Levy, M. Villaret. On the Relation Between Context and Sequence Unification. Journal of Symbolic Computation. 45(1):74–95, 2010. DOI: 10.1016/j.jsc.2009.07.001.
PDF, BibTeX. - J. Coelho, M. Florido, T. Kutsia. Collaborative Schema Construction using Regular Sequence Types. In: Proceedings of the 2009 IEEE International Conference of Information Reuse and Integration, IRI 2009. August 10–12, 2009, Las-Vegas, USA. 290–295. © IEEE.
PDF, BibTeX. - T. Kutsia. Flat Matching. Journal of Symbolic Computation 43(12):858–873, 2008. DOI: 10.1016/j.jsc.2008.05.001.
PDF, BibTeX. - J. Coelho, M. Florido, T. Kutsia. Sequence Disunification and its Application in Collaborative Schema Construction. In: M. Weske, M.-S. Hacid, C. Godart, editors, Web Information Systems - WISE 2007 Workshops. December 3–7, 2007. Nancy, France. Volume 4832 of Lecture Notes in Computer Science. Springer, 2007, 91–102. © Springer.
PDF, BibTeX. - T. Kutsia, J. Levy, M. Villaret. Sequence Unification Through Currying. In: F. Baader, editor, Proceedings of the 18th International Conference on Rewriting Techniques and Applications, RTA 2007. June 26–28, 2007, Paris, France. Volume 4533 of the Lecture Notes in Computer Science. Springer, 2007, 288–302. © Springer.
PDF, BibTeX. - T. Kutsia. Solving Equations with Sequence Variables and Sequence Functions. Journal of Symbolic Computation, 42(3):352–388, 2007. DOI: 10.1016/j.jsc.2006.12.002.
PDF, BibTeX. - T. Kutsia. Context Sequence Matching for XML. Electronic Notes on Theoretical Computer Science, 157(2):47–65, 2006. DOI: 10.1016/j.entcs.2005.12.045.
PDF, BibTeX. - T. Kutsia, M. Marin. Matching with Regular Constraints. In: G. Sutcliffe and A. Voronkov, editors, Logic in Programming, Artificial Intelligence and Reasoning. Proceedings of the 12th International Conference LPAR 2005. December 2–6, 2005, Montego Bay, Jamaica. Volume 3835 of Lecture Notes in Artificial Intelligence. Springer, 2005, 215–229. © Springer.
PDF, BibTeX. - T. Kutsia. Solving Equations Involving Sequence Variables and Sequence Functions. In: B. Buchberger and J. Campbell, editors, Proceedings of the 7th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2004. September 22–24, 2004, Hagenberg, Austria. Volume 3249 of Lecture Notes in Artificial Intelligence. Springer, 2004, 157–170. © Springer.
PDF, BibTeX. (Revised version) - T. Kutsia. Pattern Unification with Sequence Variables and Flexible Arity Symbols. Electronic Notes on Theoretical Computer Science, 66(5):52–69, 2002. DOI: 10.1016/S1571-0661(04)80514-0.
PDF, BibTeX. - T. Kutsia. Unification with Sequence Variables and Flexible Arity Symbols and its Extension with Pattern-Terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AISC-Calculemus 2002 Conference. July 1–5, 2002, Marseille, France. Volume 2385 of Lecture Notes in Artificial Intelligence. Springer, 2002, 290–304. © Springer.
PDF, BibTeX.
Workshop papers and technical reports
- G. Ehling, T. Kutsia. Matching in Quantitative Equational Theories. V. Ravishankar and C. Ringeissen, eds. 37th International Workshop on Unification, UNIF 2023, hal-04128216.
PDF. - A. González, D. Cerna, M Ayala-Rincón, T. Kutsia. On Anti-unification in Absorption Theories. V. Ravishankar and C. Ringeissen, eds. 37th International Workshop on Unification, UNIF 2023, hal-04128203.
PDF. - T. Kutsia, C. Pau. Proximity-Based Unification with Arity Mismatch. T. Kutsia and A. M. Marshall, eds. 34th International Workshop on Unification, UNIF 2020, technical Report 20-10 in RISC Report Series, RISC, Johannes Kepler University Linz, 9:1–9:6.
PDF. - T. Kutsia, C. Pau. Solving Proximity Constraints. S. Erbatur and D. Nantes, eds. 33nd International Workshop on Unification, UNIF 2019, 7 pages.
PDF. - T. Kutsia, M. Marin. Matching of Order-Sorted Terms with Regular Expression Sorts and Second-Order Variables. In: A. Bouhoula and T. Ida, editors, Tunisia-Japan Workshop on Symbolic Computation in Software Science, SCSS 2009. September 22–24, Gammarth, Tunisia.
PDF, BibTeX. - T. Kutsia, M. Marin. Order-Sorted Unification with Regular Expression Sorts. In: Ch. Lynch and P. Narendran, editors, 23th International Workshop on Unification, UNIF 2009. August 2, 2009, Montreal, Canada.
PDF, BibTeX. - T. Kutsia, M. Marin. Solving Regular Constraints for Hedges and Contexts. In: J. Levy, editor, Proceedings of the 20th International Workshop on Unification, UNIF 2006. August 11, 2006, Seattle, USA, 89–107.
PDF, BibTeX. - T. Kutsia, M. Marin. Can Context Sequence Matching be Used for Querying XML? In: L. Vigneron, editor, Proceedings of the 19th International Workshop on Unification, UNIF 2005. April 22, 2005, Nara, Japan, 77–92.
PDF, BibTeX. (Revised version) - T. Kutsia, M. Marin. Unification Procedure for Terms with Sequence Variables and Sequence Functions (Extended Abstract). Proceedings of the 18th International Workshop on Unification, UNIF 2004. July 5, 2004, Cork, Ireland.
PDF, BibTeX. - T. Kutsia. Unification Modulo Flatness. In: D. Petcu, D. Zaharie, V. Negru, and T. Jebelean, editors, Proceedings of the 5th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2003. October 1–4, 2003, Timisoara, Romania. Mirton Publishing Company, 2003, 135–148.
BibTeX. - T. Kutsia. Matching in Flat Theories. In: J. Levy, M. Kohlhase, J. Niehren, and M. Villaret, editors, Proceedings of the 17th International Workshop on Unification, UNIF 2003. June 8–9, 2003, Valencia, Spain. 57–64.
PDF, BibTeX. - T. Kutsia. Unification in the Empty and Flat Theories with Sequence Variables and Flexible Arity Symbols. In: F. Baader, V. Diekert, C. Tinelli, and R. Treinen, editors. Proceedings of 15th International Workshop on Unification, UNIF 2001. June 18–19, 2001, Siena, Italy.
BibTeX.