標(biāo)題: Titlebook: GWAI-85; 9th German Workshop Herbert Stoyan Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Expertensystem.Philosophie. [打印本頁(yè)] 作者: MOURN 時(shí)間: 2025-3-21 16:34
書目名稱GWAI-85影響因子(影響力)
書目名稱GWAI-85影響因子(影響力)學(xué)科排名
書目名稱GWAI-85網(wǎng)絡(luò)公開度
書目名稱GWAI-85網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱GWAI-85被引頻次
書目名稱GWAI-85被引頻次學(xué)科排名
書目名稱GWAI-85年度引用
書目名稱GWAI-85年度引用學(xué)科排名
書目名稱GWAI-85讀者反饋
書目名稱GWAI-85讀者反饋學(xué)科排名
作者: scrape 時(shí)間: 2025-3-21 22:46
Deena Altschwager,Kendrin R. Sonnevilleng der Konsistenz eines Netzes vorgestellt. In einem Vergleich mit den Systemen von Steele, Gosling und Freuder heben wir die wesentlichen Unterschiede zu . hervor. . ist in Lisp auf einer VAX 11/780 Anlage implementiert.作者: outset 時(shí)間: 2025-3-22 00:25
SoC Design for Testability (DFT), the various targets assigned to it, these enhancements cover very theoretical problems such as enriching negation treatment or more practical ones, such as providing access to other paradigms such as object programming or constraints programming, and possibly functional programming.作者: infantile 時(shí)間: 2025-3-22 07:34 作者: 絕種 時(shí)間: 2025-3-22 10:33 作者: Mortar 時(shí)間: 2025-3-22 16:14
Logic Programming is going in many directions the various targets assigned to it, these enhancements cover very theoretical problems such as enriching negation treatment or more practical ones, such as providing access to other paradigms such as object programming or constraints programming, and possibly functional programming.作者: Mortar 時(shí)間: 2025-3-22 18:00
https://doi.org/10.1007/978-1-137-57403-9 mit Inhibitionsmechanismen die kongruente Aktivierung von Wissenskontexten in partitionierten Netzwerken erlaubt. Daher wird die Renshaw-Inhibition als Erg?nzung zu Modellen der Aktivationsausbreitung vorgeschlagen.作者: FAST 時(shí)間: 2025-3-22 22:37 作者: 報(bào)復(fù) 時(shí)間: 2025-3-23 04:38
Michelle Sunico-Segarra,Armin Segarraeweissuche“ bzw. die ?Konstruktion von Gegenbeispielen“ wird auf die Suche nach Zyklen in verschiedenen Graphen reduziert. Dieses spezielle Beweisverfahren kann alle im vollen relationalen Kalkül [Codd72] formulierbaren Datenmengen testen.作者: 消音器 時(shí)間: 2025-3-23 06:09
Anubha Dhal,Manju Mehta,Rajesh Sagarseperating toplevel symbol and subterms of a functional term. For a further reduction of the search space some technical improvements are implemented including demodulation and a matching of termpairs using theory-matching algorithms for the cases of commutativity, associativity and a combination of both.作者: Bone-Scan 時(shí)間: 2025-3-23 11:44 作者: 錫箔紙 時(shí)間: 2025-3-23 17:21
Parallelverarbeitung in Netzwerk-Basierten Systemen mit Inhibitionsmechanismen die kongruente Aktivierung von Wissenskontexten in partitionierten Netzwerken erlaubt. Daher wird die Renshaw-Inhibition als Erg?nzung zu Modellen der Aktivationsausbreitung vorgeschlagen.作者: Decimate 時(shí)間: 2025-3-23 19:42 作者: Comprise 時(shí)間: 2025-3-23 23:09
Ein Beweisverfahren für Datenbankpr?dikateeweissuche“ bzw. die ?Konstruktion von Gegenbeispielen“ wird auf die Suche nach Zyklen in verschiedenen Graphen reduziert. Dieses spezielle Beweisverfahren kann alle im vollen relationalen Kalkül [Codd72] formulierbaren Datenmengen testen.作者: 凈禮 時(shí)間: 2025-3-24 05:18
Introduction to Microarray Data Analysis,confluence for globally finite relations. In this paper we give a theoretical framework for this extension. We will show how this theory can be applied to term rewriting systems, if we are mainly interested in the initial algebra which is induced by the set of rules.作者: helper-T-cells 時(shí)間: 2025-3-24 08:56
Robustness Analysis of Flexible Structuresitary and finitary theories. We show that the class of (non-unitary) finitary theories cannot be decomposed into a hierarchy obtained by uniformly bounding the cardinalities of the sets of most general unifiers. Hence, one cannot use the notion of “bounded size” to characterize the difference between finitary and unitary theories.作者: 競(jìng)選運(yùn)動(dòng) 時(shí)間: 2025-3-24 11:37
Completion of Globally Finite Term Rewriting Systems for Inductive Proofsconfluence for globally finite relations. In this paper we give a theoretical framework for this extension. We will show how this theory can be applied to term rewriting systems, if we are mainly interested in the initial algebra which is induced by the set of rules.作者: HERTZ 時(shí)間: 2025-3-24 18:25
On the Unification Hierarchyitary and finitary theories. We show that the class of (non-unitary) finitary theories cannot be decomposed into a hierarchy obtained by uniformly bounding the cardinalities of the sets of most general unifiers. Hence, one cannot use the notion of “bounded size” to characterize the difference between finitary and unitary theories.作者: 鍵琴 時(shí)間: 2025-3-24 22:25
https://doi.org/10.1007/978-94-011-7683-5 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.作者: 別名 時(shí)間: 2025-3-24 23:44
Colin J. Theaker,Graham R. Brookesof combined functional and logic programming languages are defined. An extended unification algorithm which additonally handles functional expressions is formally introduced to evaluate programs written in those languages. Finally, an implementation of the proposed system is described.作者: 無(wú)效 時(shí)間: 2025-3-25 05:22
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 時(shí)間: 2025-3-25 07:56 作者: 補(bǔ)角 時(shí)間: 2025-3-25 15:09
978-3-540-16451-7Springer-Verlag Berlin Heidelberg 1986作者: 令人苦惱 時(shí)間: 2025-3-25 17:34
GWAI-85978-3-642-71145-9Series ISSN 0343-3005 作者: 象形文字 時(shí)間: 2025-3-25 20:22
0343-3005 Overview: 978-3-540-16451-7978-3-642-71145-9Series ISSN 0343-3005 作者: 染色體 時(shí)間: 2025-3-26 02:36 作者: uncertain 時(shí)間: 2025-3-26 04:32 作者: 準(zhǔn)則 時(shí)間: 2025-3-26 11:33
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.作者: 和音 時(shí)間: 2025-3-26 14:14 作者: 精確 時(shí)間: 2025-3-26 20:01
https://doi.org/10.1007/978-3-642-71145-9Expertensystem; Philosophie; Roboter; Robotik; Verifikation; Wissen; Wissensbank; Wissensdatenbank; Wissensr作者: BRAND 時(shí)間: 2025-3-26 23:09
https://doi.org/10.1007/978-1-349-10642-4ectual capacities that man has, namely those of thinking and speaking. In my opinion this question can only be answered by AI-research. But even if the answer to this question should be positive, other questions will remain: would such machines have consciousness, subjectivity, intentionality? These作者: 拱形大橋 時(shí)間: 2025-3-27 02:49 作者: Efflorescent 時(shí)間: 2025-3-27 07:11 作者: ROOF 時(shí)間: 2025-3-27 10:03
Anubha Dhal,Manju Mehta,Rajesh Sagarrch space usually involved with equality. Starting from an empty graph a production system constructs graphs (equality-paths) which represent solutions for simpler problems defined by abstraction. These graphs contain global information and are plans for guiding the search for a proof of the origina作者: happiness 時(shí)間: 2025-3-27 16:03 作者: concubine 時(shí)間: 2025-3-27 18:43
Introduction to Microarray Data Analysis, cycles in a reduction chain. This problem may be solved by an extension of the KBA for globally finite term rewriting systems. For a globally finite term rewriting system, cycles may occur in a reduction chain, but for each term there is only a finite set of reductions. A confluent and globally fin作者: Ballerina 時(shí)間: 2025-3-28 00:57
Robustness Analysis of Flexible Structurest of most general unifiers..The following result is established in this paper: if T is a suitable first-order equational theory that is finitary, then T is not bounded; that is, there is no integer n>l such that for every unification problem < s = t >., the cardinality of the set of most general uni作者: 聽覺 時(shí)間: 2025-3-28 05:57 作者: 龍卷風(fēng) 時(shí)間: 2025-3-28 09:58
SoC Design for Testability (DFT),rk for tasks ranging from specification to system-programming, through theorem-proving, problem solving, knowledge representation and the like. Obviously, this induces research in various ways to enhance logic programming as it is best known and supported today, namely Prolog. Again, in the light of作者: Bricklayer 時(shí)間: 2025-3-28 12:39 作者: 健談 時(shí)間: 2025-3-28 14:36 作者: Offstage 時(shí)間: 2025-3-28 19:07
Colin J. Theaker,Graham R. Brookesof combined functional and logic programming languages are defined. An extended unification algorithm which additonally handles functional expressions is formally introduced to evaluate programs written in those languages. Finally, an implementation of the proposed system is described.作者: ARCH 時(shí)間: 2025-3-28 23:42 作者: geometrician 時(shí)間: 2025-3-29 03:59 作者: 天賦 時(shí)間: 2025-3-29 09:26 作者: 平項(xiàng)山 時(shí)間: 2025-3-29 12:35
Equality Reasoning with Equality-pathsrch space usually involved with equality. Starting from an empty graph a production system constructs graphs (equality-paths) which represent solutions for simpler problems defined by abstraction. These graphs contain global information and are plans for guiding the search for a proof of the origina作者: vocation 時(shí)間: 2025-3-29 18:15
Clause Graphs, as they were defined in the 19 possibilities. The nodes are labelled with literals and the edges (links) connect complementary unifiable literals. This report describes a generalization of this concept, called abstract clause graphs. The nodes of abstract clause graphs are still labelled with literals, the links however connect 作者: 易受騙 時(shí)間: 2025-3-29 23:46 作者: Yourself 時(shí)間: 2025-3-30 02:15 作者: 等待 時(shí)間: 2025-3-30 07:02
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 un作者: Peculate 時(shí)間: 2025-3-30 08:51 作者: endure 時(shí)間: 2025-3-30 13:08
Vermeidung überflüssiger Berechnungen in Hornklausel-Programmen durch Vor-Laufzeit-Untersuchungenu überflüssigen Berechnungen, die zum Auffinden der gewünschten L?sung nichts beitragen. Das im folgenden vorgestellte, auf einer speziellen Termdarstellung basierende Verfahren soll helfen, einen Teil dieser nutzlosen Berechnungen von vornherein zu vermeiden. Zus?tzlich k?nnen spezielle Arten von P作者: FLOUR 時(shí)間: 2025-3-30 18:23 作者: Culpable 時(shí)間: 2025-3-30 21:43
Extended Unification and its Implementationof combined functional and logic programming languages are defined. An extended unification algorithm which additonally handles functional expressions is formally introduced to evaluate programs written in those languages. Finally, an implementation of the proposed system is described.作者: 不能逃避 時(shí)間: 2025-3-31 02:54
Fundamentals of Parallel Computing,, the links to the new literals are derived from the links of their ancestors. An inheritance mechanism for such links is presented which operates only on the attached substitutions and does not have to unify the literals. This solves a long standing open problem of connection graph calculi: how to
