Software zur Satellitenkommunikation
Project Description
Projektnummer: Z-098
Project Lead
Project Duration
01/04/1998 - 30/06/2000Publications
2026
[de Freitas]
The two-mass contributions to the three-loop massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$
J. Ablinger, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, Kay Schoenwald
Journal of High Energy Physics 2026(111), pp. 1-52. 2026. ISSN 1029-8479. arXiv:2510.09403 [hep-ph]. [doi]@article{RISC7198,
author = {J. Ablinger and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and Kay Schoenwald},
title = {{The two-mass contributions to the three-loop massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$}},
language = {english},
abstract = {We calculate the two-mass three-loop contributions to the unpolarized and polarized massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$ in $x$-space for a general mass ratio by using a semi-analytic approach. We also compute Mellin moments up to $N = 2000 (3000)$ by an independent method, to which we compare the results in $x$-space. In the polarized case, we work in the Larin scheme. We present numerical results. The two-mass contributions amount to about $50 %$ of the full textcolor{blue}{$O(T_F^2)$} and textcolor{blue}{$O(T_F^3)$} terms contributing to the operator matrix elements. The present result completes the calculation of all unpolarized and polarized massive three-loop operator matrix elements.},
journal = {Journal of High Energy Physics},
volume = {2026},
number = {111},
pages = {1--52},
isbn_issn = {ISSN 1029-8479},
year = {2026},
note = {arXiv:2510.09403 [hep-ph]},
refereed = {yes},
length = {52},
url = {https://doi.org/10.1007/JHEP01(2026)111}
}
author = {J. Ablinger and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and Kay Schoenwald},
title = {{The two-mass contributions to the three-loop massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$}},
language = {english},
abstract = {We calculate the two-mass three-loop contributions to the unpolarized and polarized massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$ in $x$-space for a general mass ratio by using a semi-analytic approach. We also compute Mellin moments up to $N = 2000 (3000)$ by an independent method, to which we compare the results in $x$-space. In the polarized case, we work in the Larin scheme. We present numerical results. The two-mass contributions amount to about $50 %$ of the full textcolor{blue}{$O(T_F^2)$} and textcolor{blue}{$O(T_F^3)$} terms contributing to the operator matrix elements. The present result completes the calculation of all unpolarized and polarized massive three-loop operator matrix elements.},
journal = {Journal of High Energy Physics},
volume = {2026},
number = {111},
pages = {1--52},
isbn_issn = {ISSN 1029-8479},
year = {2026},
note = {arXiv:2510.09403 [hep-ph]},
refereed = {yes},
length = {52},
url = {https://doi.org/10.1007/JHEP01(2026)111}
}
[de Freitas]
The single-mass variable flavor number scheme at three-loop order
J. Ablinger, A. Behring, J. Bluemlein, d, A. De Freitas, A. von Manteuffel, C. Schneider, and K. Schoenwald
Journal of High Energy Physics 2026(248), pp. 0-33. 2026. SSN 1029-8479. arXiv:2510.02175 [hep-ph]. [doi]@article{RISC7229,
author = {J. Ablinger and A. Behring and J. Bluemlein and d and A. De Freitas and A. von Manteuffel and C. Schneider and and K. Schoenwald},
title = {{The single-mass variable flavor number scheme at three-loop order}},
language = {english},
abstract = {The matching relations in the unpolarized and polarized variable flavor number scheme at three-loop order are presented in the single-mass case. They describe the process of massive quarks becoming light at large virtualities $Q^2$. In this framework, heavy-quark parton distributions can be defined. Numerical results are presented on the matching relations in the case of the single-mass variable flavor number scheme for the light parton, charm and bottom quark distributions. These relations are process independent. In the polarized case we generally work in the Larin scheme. To two-loop order we present the polarized massive OMEs also in the $overline{rm MS}$ scheme. Fast numerical codes for the single-mass massive operator matrix elements are provided. },
journal = {Journal of High Energy Physics},
volume = {2026},
number = {248},
pages = {0--33},
isbn_issn = {SSN 1029-8479},
year = {2026},
note = {arXiv:2510.02175 [hep-ph]},
refereed = {yes},
length = {34},
url = {https://doi.org/10.1007/JHEP03(2026)248}
}
author = {J. Ablinger and A. Behring and J. Bluemlein and d and A. De Freitas and A. von Manteuffel and C. Schneider and and K. Schoenwald},
title = {{The single-mass variable flavor number scheme at three-loop order}},
language = {english},
abstract = {The matching relations in the unpolarized and polarized variable flavor number scheme at three-loop order are presented in the single-mass case. They describe the process of massive quarks becoming light at large virtualities $Q^2$. In this framework, heavy-quark parton distributions can be defined. Numerical results are presented on the matching relations in the case of the single-mass variable flavor number scheme for the light parton, charm and bottom quark distributions. These relations are process independent. In the polarized case we generally work in the Larin scheme. To two-loop order we present the polarized massive OMEs also in the $overline{rm MS}$ scheme. Fast numerical codes for the single-mass massive operator matrix elements are provided. },
journal = {Journal of High Energy Physics},
volume = {2026},
number = {248},
pages = {0--33},
isbn_issn = {SSN 1029-8479},
year = {2026},
note = {arXiv:2510.02175 [hep-ph]},
refereed = {yes},
length = {34},
url = {https://doi.org/10.1007/JHEP03(2026)248}
}
[de Freitas]
The complete three-loop unpolarized and polarized massive operator matrix elements and asymptotic Wilson coefficients
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald
Technical report no. 26-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). January 2026. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7234,
author = {J. Ablinger and A. Behring and J.~Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The complete three-loop unpolarized and polarized massive operator matrix elements and asymptotic Wilson coefficients}},
language = {english},
abstract = {We report on the three-loop unpolarized and polarized massive operator matrix elements, with single- and two-mass corrections, and the associated deep-inelastic massive Wilson coefficients in the region $Q^2 gg m_Q^2$, the calculation of which has been completed recently. We also provide fast and precise numerical representations ofthe massless Wilson coefficients, splitting functions to tree-loop order, and target-mass corrections in $x$-space well suited for QCD-fitting codes.},
number = {26-01},
year = {2026},
month = {January},
keywords = { three-loop unpolarized and polarized massive operator matrix elements, deep-inelastic scattering, computer algebra, special functions},
length = {16},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {J. Ablinger and A. Behring and J.~Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The complete three-loop unpolarized and polarized massive operator matrix elements and asymptotic Wilson coefficients}},
language = {english},
abstract = {We report on the three-loop unpolarized and polarized massive operator matrix elements, with single- and two-mass corrections, and the associated deep-inelastic massive Wilson coefficients in the region $Q^2 gg m_Q^2$, the calculation of which has been completed recently. We also provide fast and precise numerical representations ofthe massless Wilson coefficients, splitting functions to tree-loop order, and target-mass corrections in $x$-space well suited for QCD-fitting codes.},
number = {26-01},
year = {2026},
month = {January},
keywords = { three-loop unpolarized and polarized massive operator matrix elements, deep-inelastic scattering, computer algebra, special functions},
length = {16},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[de Freitas]
The heavy quark-antiquark asymmetry in the variable flavor number scheme
A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald
Physics Letters B 876(140411), pp. 1-8. 2026. ISSN 1873-2445. arXiv:2512.13508 [hep-ph]. [doi]@article{RISC7238,
author = {A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The heavy quark-antiquark asymmetry in the variable flavor number scheme}},
language = {english},
abstract = {The twist-2 heavy-quark and antiquark distributions, as defined in the variable flavor number scheme, turn out to be different due to QCD corrections from three-loop onward. This is caused by terms containing the color factor $d_{abc} d^{abc}$ in the heavy-flavor massive pure-singlet operator matrix elements (OMEs) $A^{rm PS, s, (3)}_{Qq}$ for odd moments in the unpolarized case and for $Delta A^{rm PS, s, (3)}_{Qq}$ for even moments in the polarized case. The dependence on the factorization scale of the OMEs is ruled by the anomalous dimensions $gamma^{rm NS, s, (2)}_{qq}$ and $Delta gamma^{rm NS, s, (2)}_{qq}$. The polarized calculations are performed in the Larin scheme. We compute the corresponding three-loop heavy-flavor distributions $(Delta) f_Q(x,Q^2) - (Delta) f_{overline{Q}}(x,Q^2)$. Compared to the sum of the heavy-quark and antiquark parton distributions, their difference is small, however, non-vanishing. },
journal = {Physics Letters B},
volume = {876},
number = {140411},
pages = {1--8},
isbn_issn = {ISSN 1873-2445},
year = {2026},
note = {arXiv:2512.13508 [hep-ph]},
refereed = {yes},
length = {8},
url = {https://doi.org/10.1016/j.physletb.2026.140411}
}
author = {A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The heavy quark-antiquark asymmetry in the variable flavor number scheme}},
language = {english},
abstract = {The twist-2 heavy-quark and antiquark distributions, as defined in the variable flavor number scheme, turn out to be different due to QCD corrections from three-loop onward. This is caused by terms containing the color factor $d_{abc} d^{abc}$ in the heavy-flavor massive pure-singlet operator matrix elements (OMEs) $A^{rm PS, s, (3)}_{Qq}$ for odd moments in the unpolarized case and for $Delta A^{rm PS, s, (3)}_{Qq}$ for even moments in the polarized case. The dependence on the factorization scale of the OMEs is ruled by the anomalous dimensions $gamma^{rm NS, s, (2)}_{qq}$ and $Delta gamma^{rm NS, s, (2)}_{qq}$. The polarized calculations are performed in the Larin scheme. We compute the corresponding three-loop heavy-flavor distributions $(Delta) f_Q(x,Q^2) - (Delta) f_{overline{Q}}(x,Q^2)$. Compared to the sum of the heavy-quark and antiquark parton distributions, their difference is small, however, non-vanishing. },
journal = {Physics Letters B},
volume = {876},
number = {140411},
pages = {1--8},
isbn_issn = {ISSN 1873-2445},
year = {2026},
note = {arXiv:2512.13508 [hep-ph]},
refereed = {yes},
length = {8},
url = {https://doi.org/10.1016/j.physletb.2026.140411}
}
[de Freitas]
The three-loop single-mass heavy-flavor corrections to the structure functions $F_2(x, Q^2)$ and $g_1(x, Q^2)$
J. Ablinger, A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schönwald
Physics Letters B 878(140540), pp. 1-8. 2026. ISSN 0370-2693. arXiv:2509.16124 [hep-ph]. [doi]@article{RISC7241,
author = {J. Ablinger and A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schönwald},
title = {{The three-loop single-mass heavy-flavor corrections to the structure functions $F_2(x,Q^2)$ and $g_1(x,Q^2)$}},
language = {english},
journal = {Physics Letters B},
volume = {878},
number = {140540},
pages = {1--8},
isbn_issn = {ISSN 0370-2693},
year = {2026},
note = {arXiv:2509.16124 [hep-ph]},
refereed = {yes},
length = {8},
url = {https://doi.org/10.1016/j.physletb.2026.140540}
}
author = {J. Ablinger and A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schönwald},
title = {{The three-loop single-mass heavy-flavor corrections to the structure functions $F_2(x,Q^2)$ and $g_1(x,Q^2)$}},
language = {english},
journal = {Physics Letters B},
volume = {878},
number = {140540},
pages = {1--8},
isbn_issn = {ISSN 0370-2693},
year = {2026},
note = {arXiv:2509.16124 [hep-ph]},
refereed = {yes},
length = {8},
url = {https://doi.org/10.1016/j.physletb.2026.140540}
}
[de Freitas]
The variable flavor number scheme to three-loop order
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald
Technical report no. 26-06 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). July 2026. DESY 26-064, RISC Report number 26-06, CERN-TH-2026-113, MPP-2026-89, PoS (LL2026) 025. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7247,
author = {J. Ablinger and A. Behring and J.~Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The variable flavor number scheme to three-loop order}},
language = {english},
abstract = {We describe the variable flavor number scheme to three-loop order, which modifies the massless parton densities by single- and two-mass effects and introduces heavy-quark parton distribution functions for charm and bottom. A renormalization group analysis shows the validity of this picture at large scales $Q^2$, where it resembles the non-power-suppressed heavy-flavor corrections completely. We also provide numerical implementations of a series of charged and neutral current Wilson coefficients.},
number = {26-06},
year = {2026},
month = {July},
note = {DESY 26--064, RISC Report number 26-06, CERN-TH-2026-113, MPP-2026-89, PoS (LL2026) 025},
keywords = {variable flavor number scheme, heavy-quark parton distribution function, computer algebra, numerical implementation},
length = {11},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {J. Ablinger and A. Behring and J.~Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The variable flavor number scheme to three-loop order}},
language = {english},
abstract = {We describe the variable flavor number scheme to three-loop order, which modifies the massless parton densities by single- and two-mass effects and introduces heavy-quark parton distribution functions for charm and bottom. A renormalization group analysis shows the validity of this picture at large scales $Q^2$, where it resembles the non-power-suppressed heavy-flavor corrections completely. We also provide numerical implementations of a series of charged and neutral current Wilson coefficients.},
number = {26-06},
year = {2026},
month = {July},
note = {DESY 26--064, RISC Report number 26-06, CERN-TH-2026-113, MPP-2026-89, PoS (LL2026) 025},
keywords = {variable flavor number scheme, heavy-quark parton distribution function, computer algebra, numerical implementation},
length = {11},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Dundua]
Quantitative Equational Rewriting
Besik Dundua, Georg Ehling, Santiago Escobar, Maribel Fernández, Temur Kutsia
Technical report no. 26-09 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). June 2026. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7245,
author = {Besik Dundua and Georg Ehling and Santiago Escobar and Maribel Fernández and Temur Kutsia},
title = {{Quantitative Equational Rewriting}},
language = {english},
abstract = {Rewriting logic is a logical framework for expressing both concurrent computation and logical deduction using equations and re-write rules. Quantitative equational reasoning enriches equations with quantitative measures, expressing concepts such as similarity or proximity rather than mere equality of terms. In this article, we bring these two approaches together and propose a quantitative extension of rewriting logic as a flexible formalism for quantitative deduction and computation.},
number = {26-09},
year = {2026},
month = {June},
keywords = {Quantitative rewriting, quantitative equational reasoning, quantitative matching},
length = {39},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Besik Dundua and Georg Ehling and Santiago Escobar and Maribel Fernández and Temur Kutsia},
title = {{Quantitative Equational Rewriting}},
language = {english},
abstract = {Rewriting logic is a logical framework for expressing both concurrent computation and logical deduction using equations and re-write rules. Quantitative equational reasoning enriches equations with quantitative measures, expressing concepts such as similarity or proximity rather than mere equality of terms. In this article, we bring these two approaches together and propose a quantitative extension of rewriting logic as a flexible formalism for quantitative deduction and computation.},
number = {26-09},
year = {2026},
month = {June},
keywords = {Quantitative rewriting, quantitative equational reasoning, quantitative matching},
length = {39},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Kutsia]
Extending Approximate Reasoning to Unranked Term Structures
Mara Antesberger
Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria. Master Thesis. 2026. [pdf]@misc{RISC7236,
author = {Mara Antesberger},
title = {{Extending Approximate Reasoning to Unranked Term Structures}},
language = {english},
year = {2026},
translation = {0},
institution = {Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria},
length = {101}
}
author = {Mara Antesberger},
title = {{Extending Approximate Reasoning to Unranked Term Structures}},
language = {english},
year = {2026},
translation = {0},
institution = {Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria},
length = {101}
}
[Pau]
Proceedings of the 40th International Workshop on Unification, UNIF 2026
Silvio Ghilardi, Cleo Pau (Editors)
Technical report no. 26-10 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). July 2026. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7248,
author = {Silvio Ghilardi and Cleo Pau (Editors)},
title = {{Proceedings of the 40th International Workshop on Unification, UNIF 2026}},
language = {english},
abstract = {This volume contains the extended abstract presented at the 40th edition of the annual international workshop on Unification (UNIF 2026), held on July 24th, 2026. The workshop was a part of the Federated Logic Conference (FLoC 2026), that unites the ten leading international conferences focused on mathematical logic and its applications in computer science, as well as over 30 satellite workshops. FLoC 2026 took place in Lisbon.},
number = {26-10},
year = {2026},
month = {July},
keywords = {unification},
length = {80},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Silvio Ghilardi and Cleo Pau (Editors)},
title = {{Proceedings of the 40th International Workshop on Unification, UNIF 2026}},
language = {english},
abstract = {This volume contains the extended abstract presented at the 40th edition of the annual international workshop on Unification (UNIF 2026), held on July 24th, 2026. The workshop was a part of the Federated Logic Conference (FLoC 2026), that unites the ten leading international conferences focused on mathematical logic and its applications in computer science, as well as over 30 satellite workshops. FLoC 2026 took place in Lisbon.},
number = {26-10},
year = {2026},
month = {July},
keywords = {unification},
length = {80},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Schneider]
A Survey on Symbolic Summation in Difference Rings
C. Schneider
Technical report no. 26-07 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). May 2026. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7242,
author = {C. Schneider},
title = {{A Survey on Symbolic Summation in Difference Rings}},
language = {english},
abstract = {This survey article provides an overview of the fundamental principles used to simplify multi-sums into indefinite nested sums over hypergeometric products in the setting of difference rings. We place special emphasis on the algorithmic translation between hypergeometric sums and the formal difference ring setting. Furthermore, we detail the core summation paradigms of telescoping, creative telescoping, and recurrence solving within difference rings, illustrating these techniques and their underlying algorithms with concrete examples.},
number = {26-07},
year = {2026},
month = {May},
keywords = {Difference ring, telescoping, creative telescoping, parameterized telescoping, recurrence solving.},
length = {31},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {C. Schneider},
title = {{A Survey on Symbolic Summation in Difference Rings}},
language = {english},
abstract = {This survey article provides an overview of the fundamental principles used to simplify multi-sums into indefinite nested sums over hypergeometric products in the setting of difference rings. We place special emphasis on the algorithmic translation between hypergeometric sums and the formal difference ring setting. Furthermore, we detail the core summation paradigms of telescoping, creative telescoping, and recurrence solving within difference rings, illustrating these techniques and their underlying algorithms with concrete examples.},
number = {26-07},
year = {2026},
month = {May},
keywords = {Difference ring, telescoping, creative telescoping, parameterized telescoping, recurrence solving.},
length = {31},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Schreiner]
Building a Logical Agent with LangChain ... and Quite Some Vibe Coding
Wolfgang Schreiner
Technical report no. 26-02 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). March 2026. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7237,
author = {Wolfgang Schreiner},
title = {{Building a Logical Agent with LangChain ... and Quite Some Vibe Coding}},
language = {english},
abstract = {This document reports on our experience of building an “agentic AI” (Artificial Intelligence) that helps a human to answer logical questions in a trustworthy way. This agent combines a Large Language Model (LLM) (which interacts with the human in natural language) with a logical software (which automatically proves formal theorems). The LLM engages in a dialogue with the human in order to translate their logical question from natural language to a formal proof problem. Once the human is satisfied with the formalization, the LLM invokes the prover to automatically solve the problem and thus answer the question; then the LLM also offers the user the possibility to inspect the successful proof or the unsuccessful proof attempt by calling the prover in an interactive mode. Furthermore, we describe how much of the source code (which is based on on the agent construction framework LangChain) has been “vibe coded”, i.e., itself generated with the help of an LLM.},
number = {26-02},
year = {2026},
month = {March},
keywords = {large language models, automated theorem proving, agentic AI, logical formalization, vibe coding},
length = {73},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Wolfgang Schreiner},
title = {{Building a Logical Agent with LangChain ... and Quite Some Vibe Coding}},
language = {english},
abstract = {This document reports on our experience of building an “agentic AI” (Artificial Intelligence) that helps a human to answer logical questions in a trustworthy way. This agent combines a Large Language Model (LLM) (which interacts with the human in natural language) with a logical software (which automatically proves formal theorems). The LLM engages in a dialogue with the human in order to translate their logical question from natural language to a formal proof problem. Once the human is satisfied with the formalization, the LLM invokes the prover to automatically solve the problem and thus answer the question; then the LLM also offers the user the possibility to inspect the successful proof or the unsuccessful proof attempt by calling the prover in an interactive mode. Furthermore, we describe how much of the source code (which is based on on the agent construction framework LangChain) has been “vibe coded”, i.e., itself generated with the help of an LLM.},
number = {26-02},
year = {2026},
month = {March},
keywords = {large language models, automated theorem proving, agentic AI, logical formalization, vibe coding},
length = {73},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Schreiner]
An Intermediate Representation Format for Industrial Optimization Problems - The Translation of OptDSL to MiniZinc
Tereso del Río, Wolfgang Schreiner, Martina Seidl, Temur Kutsia, Wolfgang Windsteiger
Technical report no. 26-04 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). April 2026. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7239,
author = {Tereso del Río and Wolfgang Schreiner and Martina Seidl and Temur Kutsia and Wolfgang Windsteiger },
title = {{An Intermediate Representation Format for Industrial Optimization Problems - The Translation of OptDSL to MiniZinc}},
language = {english},
abstract = {This report presents the implementation of OptDSL, a Python-inspired domain-specific language for describing optimisation problems. The implementation is based on the translationof a high-level OptDSL formulation of the problem to an intermediate representation in the constraint modelling language MiniZinc, which can be used by multiple state-of-the-art solvers. The report also describes the translation software, illustrates its use on a simplified industrial example, discusses selected implementation details, and suggests directions for further development.},
number = {26-04},
year = {2026},
month = {April},
keywords = {industrial optimization, domain-specific languages, constraint solving, formal languages, translation},
sponsor = {Supported by the FFG project FO999923579 “InProSSA: Industrial Problem Solving Using Symbolic and Subsymbolic AI”},
length = {88},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Tereso del Río and Wolfgang Schreiner and Martina Seidl and Temur Kutsia and Wolfgang Windsteiger },
title = {{An Intermediate Representation Format for Industrial Optimization Problems - The Translation of OptDSL to MiniZinc}},
language = {english},
abstract = {This report presents the implementation of OptDSL, a Python-inspired domain-specific language for describing optimisation problems. The implementation is based on the translationof a high-level OptDSL formulation of the problem to an intermediate representation in the constraint modelling language MiniZinc, which can be used by multiple state-of-the-art solvers. The report also describes the translation software, illustrates its use on a simplified industrial example, discusses selected implementation details, and suggests directions for further development.},
number = {26-04},
year = {2026},
month = {April},
keywords = {industrial optimization, domain-specific languages, constraint solving, formal languages, translation},
sponsor = {Supported by the FFG project FO999923579 “InProSSA: Industrial Problem Solving Using Symbolic and Subsymbolic AI”},
length = {88},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Schreiner]
On the Rapid Prototyping of a Logical Agent
Wolfgang Schreiner
In: SCML-2026: International Conference on Symbolic Computation and Machine Learning - Extended Abstracts, Bruno Buchberger, François Charton, Matthew England, Cezary Kaliszyk, Manuel Kauers, Hiroshi Kera, Temur Kutsia, Bernhard Moser, Markus Schedl, Wolfgang Schreiner, Martina Seidl, Wolfgang Windsteiger (ed.), RISC Proceedings on Symbolic Computation and Machine Learning 3, pp. 78-79. 2026. SCML, https://scml.risc.jku.at/, ISSN XXXX. [doi]@inproceedings{RISC7244,
author = {Wolfgang Schreiner},
title = {{On the Rapid Prototyping of a Logical Agent}},
booktitle = {{SCML-2026: International Conference on Symbolic Computation and Machine Learning - Extended Abstracts}},
language = {english},
abstract = {We report on our experience with the rapid prototyping of an “agentic AI” that helps a human to answer logical questions in a trustworthy way. This agent combines a Large Language Model (LLM) (which interacts with the human in natural language) with a logical software (which automatically proves formal theorems). The LLM engages in a dialogue with the human in order to translate their logical question from natural language to a formal proof problem. Once the human is satisfied with the formalization, the LLM invokes the prover to automatically solve the problem and thus answer the question; then the LLM also offers the user the possibility to inspect the successful proof or the unsuccessful proof attempt by calling the prover in an interactive mode. Furthermore, we describe how much of the source code (which is based on on the agent construction framework LangChain) has been “vibe coded”, i.e., itself generated with the help of an LLM.},
series = {RISC Proceedings on Symbolic Computation and Machine Learning},
number = {3},
pages = {78--79},
publisher = {SCML},
address = {https://scml.risc.jku.at/},
isbn_issn = {ISSN XXXX},
year = {2026},
editor = {Bruno Buchberger and François Charton and Matthew England and Cezary Kaliszyk and Manuel Kauers and Hiroshi Kera and Temur Kutsia and Bernhard Moser and Markus Schedl and Wolfgang Schreiner and Martina Seidl and Wolfgang Windsteiger},
refereed = {no},
keywords = {large language models, automated theorem proving, agentic AI, logical formalization, vibe coding},
length = {2},
url = {https://www.doi.org/doi.org/10.35011/risc-proceedings-scml.3}
}
author = {Wolfgang Schreiner},
title = {{On the Rapid Prototyping of a Logical Agent}},
booktitle = {{SCML-2026: International Conference on Symbolic Computation and Machine Learning - Extended Abstracts}},
language = {english},
abstract = {We report on our experience with the rapid prototyping of an “agentic AI” that helps a human to answer logical questions in a trustworthy way. This agent combines a Large Language Model (LLM) (which interacts with the human in natural language) with a logical software (which automatically proves formal theorems). The LLM engages in a dialogue with the human in order to translate their logical question from natural language to a formal proof problem. Once the human is satisfied with the formalization, the LLM invokes the prover to automatically solve the problem and thus answer the question; then the LLM also offers the user the possibility to inspect the successful proof or the unsuccessful proof attempt by calling the prover in an interactive mode. Furthermore, we describe how much of the source code (which is based on on the agent construction framework LangChain) has been “vibe coded”, i.e., itself generated with the help of an LLM.},
series = {RISC Proceedings on Symbolic Computation and Machine Learning},
number = {3},
pages = {78--79},
publisher = {SCML},
address = {https://scml.risc.jku.at/},
isbn_issn = {ISSN XXXX},
year = {2026},
editor = {Bruno Buchberger and François Charton and Matthew England and Cezary Kaliszyk and Manuel Kauers and Hiroshi Kera and Temur Kutsia and Bernhard Moser and Markus Schedl and Wolfgang Schreiner and Martina Seidl and Wolfgang Windsteiger},
refereed = {no},
keywords = {large language models, automated theorem proving, agentic AI, logical formalization, vibe coding},
length = {2},
url = {https://www.doi.org/doi.org/10.35011/risc-proceedings-scml.3}
}
[Windsteiger]
Reasoning over Legal Texts Using Large Language Models and Automated Reasoning
Verena Praher, Endre Szasz-Revai, Wolfgang Windsteiger
In: SCML-2026: International Conference on Symbolic Computation and Machine Learning - Extended Abstracts, Bruno Buchberger, François Charton, Matthew England, Cezary Kaliszyk, Manuel Kauers, Hiroshi Kera, Temur Kutsia, Bernhard Moser, Markus Schedl, Wolfgang Schreiner, Martina Seidl, Wolfgang Windsteig (ed.), RISC Proceedings on Symbolic Computation and Machine Learning 3, pp. 76-77. 2026. SCML, https://scml.risc.jku.at/, ISSN xxxx. [doi] [pdf]@inproceedings{RISC7246,
author = {Verena Praher and Endre Szasz-Revai and Wolfgang Windsteiger},
title = {{Reasoning over Legal Texts Using Large Language Models and Automated Reasoning}},
booktitle = {{SCML-2026: International Conference on Symbolic Computation and Machine Learning - Extended Abstracts}},
language = {english},
abstract = {This presentation describes an ongoing project in the area of tax law. The goal of theproject is to bring computer-support to the decision process regarding taxation for internationalbusinesses. In particular, in a first prototype, the focus lies on transfer pricing,which is a non-trivial price-determination and taxation process that concerns businesses with divisions distributedover different countries or economies. We describe the ideaspursued in the project, we do not yet have results nor can we report on their criticalevaluation by practitioners.},
series = {RISC Proceedings on Symbolic Computation and Machine Learning},
number = {3},
pages = {76--77},
publisher = {SCML},
address = {https://scml.risc.jku.at/},
isbn_issn = {ISSN xxxx},
year = {2026},
editor = {Bruno Buchberger and François Charton and Matthew England and Cezary Kaliszyk and Manuel Kauers and Hiroshi Kera and Temur Kutsia and Bernhard Moser and Markus Schedl and Wolfgang Schreiner and Martina Seidl and Wolfgang Windsteig},
refereed = {no},
length = {2},
url = {https://doi.org/10.35011/risc-proceedings-scml.3}
}
author = {Verena Praher and Endre Szasz-Revai and Wolfgang Windsteiger},
title = {{Reasoning over Legal Texts Using Large Language Models and Automated Reasoning}},
booktitle = {{SCML-2026: International Conference on Symbolic Computation and Machine Learning - Extended Abstracts}},
language = {english},
abstract = {This presentation describes an ongoing project in the area of tax law. The goal of theproject is to bring computer-support to the decision process regarding taxation for internationalbusinesses. In particular, in a first prototype, the focus lies on transfer pricing,which is a non-trivial price-determination and taxation process that concerns businesses with divisions distributedover different countries or economies. We describe the ideaspursued in the project, we do not yet have results nor can we report on their criticalevaluation by practitioners.},
series = {RISC Proceedings on Symbolic Computation and Machine Learning},
number = {3},
pages = {76--77},
publisher = {SCML},
address = {https://scml.risc.jku.at/},
isbn_issn = {ISSN xxxx},
year = {2026},
editor = {Bruno Buchberger and François Charton and Matthew England and Cezary Kaliszyk and Manuel Kauers and Hiroshi Kera and Temur Kutsia and Bernhard Moser and Markus Schedl and Wolfgang Schreiner and Martina Seidl and Wolfgang Windsteig},
refereed = {no},
length = {2},
url = {https://doi.org/10.35011/risc-proceedings-scml.3}
}
2025
[Baumgartner]
Equational Generalization Problems with Atom-Variables
Alexander Baumgartner, Temur Kutsia, Daniele Nantes-Sobrinho, Manfred Schmidt-Schauss
In: Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings, Valeria de Paiva and Peter Koepke (ed.), Lecture Notes in Computer Science 16136, pp. 133-151. 2025. Springer, ISBN 978-3-032-07020-3. [doi]@inproceedings{RISC7188,
author = {Alexander Baumgartner and Temur Kutsia and Daniele Nantes-Sobrinho and Manfred Schmidt-Schauss},
title = {{Equational Generalization Problems with Atom-Variables}},
booktitle = {{Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16136},
pages = {133--151},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-07020-3},
year = {2025},
editor = {Valeria de Paiva and Peter Koepke},
refereed = {yes},
length = {19},
url = {https://doi.org/10.1007/978-3-032-07021-0_8}
}
author = {Alexander Baumgartner and Temur Kutsia and Daniele Nantes-Sobrinho and Manfred Schmidt-Schauss},
title = {{Equational Generalization Problems with Atom-Variables}},
booktitle = {{Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {16136},
pages = {133--151},
publisher = {Springer},
isbn_issn = {ISBN 978-3-032-07020-3},
year = {2025},
editor = {Valeria de Paiva and Peter Koepke},
refereed = {yes},
length = {19},
url = {https://doi.org/10.1007/978-3-032-07021-0_8}
}
[Baumgartner]
Quantitative generalization of variadic structures with binders
Alexander Baumgartner, Temur Kutsia
Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria. Technical report, 2025. [pdf]@techreport{RISC7231,
author = {Alexander Baumgartner and Temur Kutsia},
title = {{Quantitative generalization of variadic structures with binders}},
language = {english},
year = {2025},
institution = {Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria},
length = {25}
}
author = {Alexander Baumgartner and Temur Kutsia},
title = {{Quantitative generalization of variadic structures with binders}},
language = {english},
year = {2025},
institution = {Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria},
length = {25}
}
[Cerna]
Combining Generalization Algorithms in Regular Collapse-Free Theories
Mauricio Ayala-Rincón, David Cerna, Temur Kutsia, Christophe Ringeissen
In: Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025), Maribel Fernandez (ed.), LIPIcs - Leibniz International Proceedings in Informatics 337, pp. 7:1-7:18. 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, ISBN 978-3-95977-374-4. [doi]@inproceedings{RISC7156,
author = {Mauricio Ayala-Rincón and David Cerna and Temur Kutsia and Christophe Ringeissen},
title = {{Combining Generalization Algorithms in Regular Collapse-Free Theories}},
booktitle = {{Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)}},
language = {english},
series = {LIPIcs - Leibniz International Proceedings in Informatics},
volume = {337},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn_issn = {ISBN 978-3-95977-374-4},
year = {2025},
editor = {Maribel Fernandez},
refereed = {yes},
length = {0},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2025.7}
}
author = {Mauricio Ayala-Rincón and David Cerna and Temur Kutsia and Christophe Ringeissen},
title = {{Combining Generalization Algorithms in Regular Collapse-Free Theories}},
booktitle = {{Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)}},
language = {english},
series = {LIPIcs - Leibniz International Proceedings in Informatics},
volume = {337},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn_issn = {ISBN 978-3-95977-374-4},
year = {2025},
editor = {Maribel Fernandez},
refereed = {yes},
length = {0},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2025.7}
}
[Chen]
A Unified Reduction for Hypergeometric and $q$-Hypergeometric Creative Telescoping
Shaoshi Chen, Hao Du, Yiman Gao, Hui Huang, Ziming Li
The Ramanujan J. 68(14), pp. 1-39. 2025. ISSN 1572-9303. arXiv:2501.03837 [cs.SC]. [doi] [pdf]@article{RISC7154,
author = {Shaoshi Chen and Hao Du and Yiman Gao and Hui Huang and Ziming Li},
title = {{A Unified Reduction for Hypergeometric and $q$-Hypergeometric Creative Telescoping}},
language = {english},
journal = {The Ramanujan J.},
volume = {68},
number = {14},
pages = {1--39},
isbn_issn = {ISSN 1572-9303},
year = {2025},
note = {arXiv:2501.03837 [cs.SC]},
refereed = {yes},
length = {39},
url = {https://doi.org/10.1007/s11139-025-01164-w}
}
author = {Shaoshi Chen and Hao Du and Yiman Gao and Hui Huang and Ziming Li},
title = {{A Unified Reduction for Hypergeometric and $q$-Hypergeometric Creative Telescoping}},
language = {english},
journal = {The Ramanujan J.},
volume = {68},
number = {14},
pages = {1--39},
isbn_issn = {ISSN 1572-9303},
year = {2025},
note = {arXiv:2501.03837 [cs.SC]},
refereed = {yes},
length = {39},
url = {https://doi.org/10.1007/s11139-025-01164-w}
}
[Dominici]
Linear functionals and Δ-coherent pairs of the second kind
Diego Dominici, Francisco Marcellán
Revista Union Matematica Argentina 68(2), pp. 405-422. 2025. 1669-9637. [doi]@article{RISC7230,
author = {Diego Dominici and Francisco Marcellán},
title = {{Linear functionals and Δ-coherent pairs of the second kind }},
language = {english},
abstract = {We classify all the Δ-coherent pairs of measures of the second kind on the real line. We obtain five cases, corresponding to all the families of discrete semiclassical orthogonal polynomials of class s ≤ 1. },
journal = {Revista Union Matematica Argentina},
volume = {68},
number = {2},
pages = {405--422},
isbn_issn = {1669-9637},
year = {2025},
refereed = {yes},
length = {18},
url = {https://doi.org/10.33044/revuma.4349}
}
author = {Diego Dominici and Francisco Marcellán},
title = {{Linear functionals and Δ-coherent pairs of the second kind }},
language = {english},
abstract = {We classify all the Δ-coherent pairs of measures of the second kind on the real line. We obtain five cases, corresponding to all the families of discrete semiclassical orthogonal polynomials of class s ≤ 1. },
journal = {Revista Union Matematica Argentina},
volume = {68},
number = {2},
pages = {405--422},
isbn_issn = {1669-9637},
year = {2025},
refereed = {yes},
length = {18},
url = {https://doi.org/10.33044/revuma.4349}
}
[Dundua]
Higher-Order Pattern Unification Modulo Similarity Relations
Besik Dundua, Temur Kutsia
Technical report no. 25-03 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2025. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7141,
author = {Besik Dundua and Temur Kutsia},
title = {{Higher-Order Pattern Unification Modulo Similarity Relations}},
language = {english},
abstract = {The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient reasoning and computational techniques for such a combined formalism presents a significant challenge. In this paper, we adopt a more straightforward approach aiming at integrating two well-established and computationally well-behaving components: higher-order patterns on one side and fuzzy equivalences expressed through similarity relations based on minimum T-norm on the other. We propose a unification algorithm for higher-order patterns modulo these similarity relations and prove its termination, soundness, and completeness. This unification problem, like its crisp counterpart, is unitary. The algorithm computes the most general unifier with the highest degree of approximation when the given terms are unifiable.},
number = {25-03},
year = {2025},
month = {February},
keywords = {Unification, higher-order patterns, fuzzy similarity relations},
length = {20},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {Besik Dundua and Temur Kutsia},
title = {{Higher-Order Pattern Unification Modulo Similarity Relations}},
language = {english},
abstract = {The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient reasoning and computational techniques for such a combined formalism presents a significant challenge. In this paper, we adopt a more straightforward approach aiming at integrating two well-established and computationally well-behaving components: higher-order patterns on one side and fuzzy equivalences expressed through similarity relations based on minimum T-norm on the other. We propose a unification algorithm for higher-order patterns modulo these similarity relations and prove its termination, soundness, and completeness. This unification problem, like its crisp counterpart, is unitary. The algorithm computes the most general unifier with the highest degree of approximation when the given terms are unifiable.},
number = {25-03},
year = {2025},
month = {February},
keywords = {Unification, higher-order patterns, fuzzy similarity relations},
length = {20},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
