Symbolic Computation Techniques for Unranked Terms [SToUT]

@article{RISC6116,
author = {Ilias Kotsireas and Temur Kutsia and Dimitris Simos},
title = {{ Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques}},
language = {english},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {88},
number = {1},
pages = {213--236},
isbn_issn = {ISSN 1573-7470},
year = {2020},
refereed = {yes},
length = {24},
url = {https://doi.org/10.1007/s10472-018-9607-9}
}

@article{RISC5192,
author = {Alexander Baumgartner and Temur Kutsia},
title = {{Unranked Second-Order Anti-Unification}},
language = {english},
journal = {Information and Computation},
volume = {255},
number = {2},
pages = {262--286},
isbn_issn = {ISSN: 0890-5401},
year = {2017},
refereed = {yes},
length = {25},
url = {http://doi.org/10.1016/j.ic.2017.01.005}
}

@article{RISC5337,
author = {Alexander Baumgartner and Temur Kutsia and Jordi Levy and Mateu Villaret},
title = {{Higher-Order Pattern Anti-Unification in Linear Time}},
language = {english},
journal = { Journal of Automated Reasoning},
volume = {58},
number = {2},
pages = {293--310},
isbn_issn = {ISSN 0168-7433},
year = {2017},
refereed = {yes},
length = {18},
url = {http://dx.doi.org/10.1007/s10817-016-9383-3}
}

@article{RISC5517,
author = {Sandra Alves and Besik Dundua and Mario Florido and Temur Kutsia},
title = {{Pattern-Based Calculi with Finitary Matching}},
language = {english},
journal = {Logic Journal of the IGPL},
pages = {--},
publisher = {Oxford University Press},
isbn_issn = {ISSN 1367-0751},
year = {2017},
note = {To appear},
refereed = {yes},
length = {41},
url = {https://doi.org/10.1093/JIGPAL/jzx059}
}

@article{RISC5133,
author = {Besik Dundua and Mario Florido and Temur Kutsia and Mircea Marin},
title = {{CLP(H): Constraint Logic Programming for Hedges}},
language = {english},
journal = {Theory and Practice of Logic Programming},
volume = {16},
number = {2},
pages = {141--162},
isbn_issn = {ISSN 1471-0684},
year = {2016},
refereed = {yes},
sponsor = {FWF under the project P 24087-N18},
length = {22},
url = {http://arxiv.org/abs/1503.00336}
}

@article{RISC5243,
author = {Bruno Buchberger and Tudor Jebelean and Temur Kutsia and Alexander Maletzky and Wolfgang Windsteiger},
title = {{Theorema 2.0: Computer-Assisted Natural-Style Mathematics}},
language = {english},
abstract = {The Theorema project aims at the development of a computer assistant for the working mathematician. Support should be given throughout all phases of mathematical activity, from introducing new mathematical concepts by definitions or axioms, through first (computational) experiments, the formulation of theorems, their justification by an exact proof, the application of a theorem as an algorithm, until to the dissemination of the results in form of a mathematical publication, the build up of bigger libraries of certified mathematical content and the like. This ambitious project is exactly along the lines of the QED manifesto issued in 1994 (see e.g. http://www.cs.ru.nl/~freek/qed/qed.html) and it was initiated in the mid-1990s by Bruno Buchberger. The Theorema system is a computer implementation of the ideas behind the Theorema project. One focus lies on the natural style of system input (in form of definitions, theorems, algorithms, etc.), system output (mainly in form of mathematical proofs) and user interaction. Another focus is theory exploration, i.e. the development of large consistent mathematical theories in a formal frame, in contrast to just proving single isolated theorems. When using the Theorema system, a user should not have to follow a certain style of mathematics enforced by the system (e.g. basing all of mathematics on set theory or certain variants of type theory), rather should the system support the user in her preferred flavour of doing math. The new implementation of the system, which we refer to as Theorema 2.0, is open-source and available through GitHub.},
journal = {JFR},
volume = {9},
number = {1},
pages = {149--185},
isbn_issn = {ISSN 1972-5787},
year = {2016},
refereed = {yes},
keywords = {Mathematical assistant systems, Theorema, automated reasoning, theory exploration, unification},
length = {37},
url = {http://dx.doi.org/10.6092/issn.1972-5787/4568}
}