Titlebook: GWAI-85; 9th German Workshop Herbert Stoyan Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Expertensystem.Philosophie.

无效

The many-sorted first order calculus ∑RP* is be 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

补角

978-3-540-16451-7Springer-Verlag Berlin Heidelberg 1986

令人苦恼

GWAI-85978-3-642-71145-9Series ISSN 0343-3005

象形文字

0343-3005 Overview: 978-3-540-16451-7978-3-642-71145-9Series ISSN 0343-3005

染色体

uncertain

准则

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.

和音

精确

https://doi.org/10.1007/978-3-642-71145-9Expertensystem; Philosophie; Roboter; Robotik; Verifikation; Wissen; Wissensbank; Wissensdatenbank; Wissensr