无效
发表于 2025-3-25 05:22:48
The many-sorted first order calculus ∑RP* isbe of some lesser sort S’. The heart of such a calculus is the unification algorithm for terms, which respects the declarations. In this paper it is shown, that the set of most general DS-unifiers is recursively enumerable and that such a set may be infinite. Furthermore, it is shown, that it is undecidable, whether two terms are DS-unifiable.
In-Situ
发表于 2025-3-25 07:56:07
http://reply.papertrans.cn/39/3802/380188/380188_22.png
补角
发表于 2025-3-25 15:09:14
978-3-540-16451-7Springer-Verlag Berlin Heidelberg 1986
令人苦恼
发表于 2025-3-25 17:34:50
GWAI-85978-3-642-71145-9Series ISSN 0343-3005
象形文字
发表于 2025-3-25 20:22:16
0343-3005 Overview: 978-3-540-16451-7978-3-642-71145-9Series ISSN 0343-3005
染色体
发表于 2025-3-26 02:36:17
http://reply.papertrans.cn/39/3802/380188/380188_26.png
uncertain
发表于 2025-3-26 04:32:03
http://reply.papertrans.cn/39/3802/380188/380188_27.png
准则
发表于 2025-3-26 11:33:23
Two Parallel Versions of the Connection Method for Propositional Logic on the L-MachineTwo parallel versions of the Connection Method for propositional logic are presented in this paper. The first one has been implemented on the L-machine, which is an asynchronously working, universally programmable multi-microprocessor system.
和音
发表于 2025-3-26 14:14:06
http://reply.papertrans.cn/39/3802/380188/380188_29.png
精确
发表于 2025-3-26 20:01:36
https://doi.org/10.1007/978-3-642-71145-9Expertensystem; Philosophie; Roboter; Robotik; Verifikation; Wissen; Wissensbank; Wissensdatenbank; Wissensr