標(biāo)題: Titlebook: GWAI-89 13th German Workshop on Artificial Intelligence; Eringerfeld, 18.–22. Dieter Metzing Conference proceedings 1989 Springer-Verlag Be [打印本頁] 作者: 要求 時(shí)間: 2025-3-21 17:24
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence影響因子(影響力)
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence影響因子(影響力)學(xué)科排名
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence網(wǎng)絡(luò)公開度
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence被引頻次
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence被引頻次學(xué)科排名
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence年度引用
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence年度引用學(xué)科排名
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence讀者反饋
書目名稱GWAI-89 13th German Workshop on Artificial Intelligence讀者反饋學(xué)科排名
作者: 食品室 時(shí)間: 2025-3-21 20:56
A New Deductive Approach to Planning. SLD-resolution, where the traditional unification algorithm has been replaced by an .-unification procedure. We examplify the properties of our method such as forward and backward reasoning, plan checking, and the integration of general theories. Finally, we present the calculus and show that it is sound and complete.作者: 貧窮地活 時(shí)間: 2025-3-22 00:43
Eqtheopogles A Completion Theorem Prover for PL1EQnfailing”) completion for pure equational reasoning. An overview of the system and its inference rules is given. EQTHEOPOGLES is shown to be complete even with interreduction and further improvements are discussed.作者: Extricate 時(shí)間: 2025-3-22 06:46
A Resolution Calculus Extended by Equivalenceuivalence. Using equivalence is one way to transform an equality free representation of problems, for which resolution often performs very poorly, into a more suited equality-like notation that allows the use of the appropriate inference rules.作者: effrontery 時(shí)間: 2025-3-22 09:54 作者: 魯莽 時(shí)間: 2025-3-22 13:27 作者: 魯莽 時(shí)間: 2025-3-22 19:31
0343-3005 in der Bundesrepublik pr?sentiert wird. Es reicht von Vortr?gen über aktuelle Forschungsarbeiten bis zu speziellen Seminaren und dort von Grundlagenveranstaltungen (Formale und Kognitive Grundlagen von Wissensrepr?sentationen; Einführung in Maschinelles Lernen und in spezielle h?here problemorienti作者: 帶來的感覺 時(shí)間: 2025-3-22 21:48
https://doi.org/10.1007/978-1-349-06364-2 for this calculus. First, we prove its soundness through a translation into a suitable situational calculus. Second, we interpret it in a particular modal semantics. Third, we propose how to extend the semantics of first-order logic for the expression of planning problems.作者: 某人 時(shí)間: 2025-3-23 02:27
Praxis, Agency, Contestation, Learning,. SLD-resolution, where the traditional unification algorithm has been replaced by an .-unification procedure. We examplify the properties of our method such as forward and backward reasoning, plan checking, and the integration of general theories. Finally, we present the calculus and show that it is sound and complete.作者: Fulminate 時(shí)間: 2025-3-23 06:23 作者: prediabetes 時(shí)間: 2025-3-23 12:58
How Net Present Value Is Implemented,uivalence. Using equivalence is one way to transform an equality free representation of problems, for which resolution often performs very poorly, into a more suited equality-like notation that allows the use of the appropriate inference rules.作者: Left-Atrium 時(shí)間: 2025-3-23 14:38
‘Absolutism’ and ‘Consequentialism’culus for generalized equational programs which is based on the inference rules E-paramodulation and E-reflection. This calculus is proven to be sound and complete by using fixpoint theory. Finally, we discuss why the functional reflexive axioms have to be used to ensure these results.作者: 不遵守 時(shí)間: 2025-3-23 21:41 作者: 和平主義者 時(shí)間: 2025-3-23 22:55 作者: 手段 時(shí)間: 2025-3-24 03:49 作者: 邪惡的你 時(shí)間: 2025-3-24 08:40 作者: chandel 時(shí)間: 2025-3-24 11:24
Proof Transformation Towards Human Reasoning Stylepound inference rules. An algorithm is developed to generate these rules from axioms and theorems of any particular mathematical theory. Then another algorithm will raise the input proofs using these rules.作者: 抓住他投降 時(shí)間: 2025-3-24 18:11 作者: Harpoon 時(shí)間: 2025-3-24 20:29
An Introduction to Two-dimensional Geometry, systems may raise serious complexity problems. In order to overcome these problems we use the basic ideas of assumption-based systems, i.e. caching of inference steps and label propagation, and apply them to both assumption sets and temporal information.作者: Biomarker 時(shí)間: 2025-3-25 00:30
Analysis of Control Flow and Data Flowblem in AEL und DL ist. Dazu werden alle minimalen und konsistenten Annahmenmengen herangezogen, aus denen eine Formel folgt. Diese müssen wiederum von einem (abduktiven) klassischen Beweiser bestimmt werden.作者: STYX 時(shí)間: 2025-3-25 04:25 作者: 留戀 時(shí)間: 2025-3-25 08:17
Learning Beyond the Traditionalsm contained in both matching and occur-check..For the actual implementation different network structures are considered. A star-connected network is proposed as most adequate to the problem, as deadlocks can be easily avoided and the communication is reduced to a minimum.作者: gonioscopy 時(shí)間: 2025-3-25 15:40
Propagation of Temporally Indexed Values in Multiple Contexts systems may raise serious complexity problems. In order to overcome these problems we use the basic ideas of assumption-based systems, i.e. caching of inference steps and label propagation, and apply them to both assumption sets and temporal information.作者: 珊瑚 時(shí)間: 2025-3-25 17:41
Nicht-monotone Beweiser für Autoepistemische Logik und Defaultlogikblem in AEL und DL ist. Dazu werden alle minimalen und konsistenten Annahmenmengen herangezogen, aus denen eine Formel folgt. Diese müssen wiederum von einem (abduktiven) klassischen Beweiser bestimmt werden.作者: 拔出 時(shí)間: 2025-3-25 21:51 作者: 持續(xù) 時(shí)間: 2025-3-26 00:12 作者: maudtin 時(shí)間: 2025-3-26 06:06 作者: Outmoded 時(shí)間: 2025-3-26 10:35
978-3-540-51743-6Springer-Verlag Berlin Heidelberg 1989作者: Aggrandize 時(shí)間: 2025-3-26 13:46 作者: larder 時(shí)間: 2025-3-26 18:44
An Introduction to Two-dimensional Geometry,oning about time. Assumption-based truth maintenance systems simultaneously handle multiple, possibly contradictory views, which may be characterized by different sets of assumptions about correctness of components, particular operating modes, etc.. This is mainly achieved by recording inference ste作者: 奇思怪想 時(shí)間: 2025-3-27 00:01
Analysis of Control Flow and Data Flowuch inkoh?rente Theorien (d.h. solche ohne Extension) bearbeiten k?nnen. Allerdings betrachten wir nur endliche Theorien und fordern, da? die klassische Ableitbarkeit für die zugrundeliegende Sprache erster Stufe entscheidbar ist. In einem ersten Schritt reduzieren wir Extensionen auf zugrundeliegen作者: Fermentation 時(shí)間: 2025-3-27 03:41 作者: WITH 時(shí)間: 2025-3-27 07:06
https://doi.org/10.1007/978-94-011-7804-4t automatically a first-order many-sorted resolution and paramodulation calculus is obtained. This calculus can be executed on a clause based predicate logic theorem prover. The class of logics which can be handled with the CL-methodology is mainly characterized by the existence of “hidden parameter作者: aerobic 時(shí)間: 2025-3-27 09:45 作者: flamboyant 時(shí)間: 2025-3-27 15:50 作者: observatory 時(shí)間: 2025-3-27 21:13
https://doi.org/10.1007/978-1-349-06364-2, which integrates such changes in the form of transition rules into a classical logic framework. This paper presents three ways towards the semantics for this calculus. First, we prove its soundness through a translation into a suitable situational calculus. Second, we interpret it in a particular 作者: FLAIL 時(shí)間: 2025-3-28 01:47 作者: chisel 時(shí)間: 2025-3-28 04:59 作者: grotto 時(shí)間: 2025-3-28 08:00 作者: 羞辱 時(shí)間: 2025-3-28 12:59
https://doi.org/10.1007/978-1-4614-2012-5st order polynomials and terms. It combines the advantages of the THEOPOGLES system for pure first order predicate calculus with the advantages of (“unfailing”) completion for pure equational reasoning. An overview of the system and its inference rules is given. EQTHEOPOGLES is shown to be complete 作者: 規(guī)章 時(shí)間: 2025-3-28 15:05 作者: Crohns-disease 時(shí)間: 2025-3-28 19:54 作者: 性別 時(shí)間: 2025-3-29 02:04
The Concept of God: Monotheism,retation of prediction failures in case-based reasoning. Furthermore, the explanation of results of a reasoning process to a user who is not a domain expert must be a component of any inference system. Experience with expert systems has shown that the ability to generate explanations is absolutely c作者: 微不足道 時(shí)間: 2025-3-29 06:38 作者: HAUNT 時(shí)間: 2025-3-29 11:16 作者: Lethargic 時(shí)間: 2025-3-29 14:26 作者: Vasoconstrictor 時(shí)間: 2025-3-29 17:37
Within and Without: Systems and SurroundingsAufgabe dient ein einfaches Schachendspiel von Turm und K?nig gegen K?nig. Das betrachtete Netzwerk soll eine Zuordnung von Zügen zu Strategien lernen. Als Eingabe wird dem Netzwerk Eingangsinformation niedriger Ordnung angeboten.作者: BAN 時(shí)間: 2025-3-29 22:11 作者: Feedback 時(shí)間: 2025-3-29 23:57 作者: ferment 時(shí)間: 2025-3-30 06:55 作者: headway 時(shí)間: 2025-3-30 10:52
Nicht-monotone Beweiser für Autoepistemische Logik und Defaultlogikuch inkoh?rente Theorien (d.h. solche ohne Extension) bearbeiten k?nnen. Allerdings betrachten wir nur endliche Theorien und fordern, da? die klassische Ableitbarkeit für die zugrundeliegende Sprache erster Stufe entscheidbar ist. In einem ersten Schritt reduzieren wir Extensionen auf zugrundeliegen作者: TRACE 時(shí)間: 2025-3-30 16:21
Problem Solver Control Over the ATMSe assumptions underlying them. This enables the problem solver to switch rapidly between contexts and compare them. Applications to larger problems have been hampered, however, by the problem solver’s inability to maintain control over the...We present a new approach which allows the problem solver 作者: Iatrogenic 時(shí)間: 2025-3-30 20:17 作者: 冒號(hào) 時(shí)間: 2025-3-31 00:24 作者: 英寸 時(shí)間: 2025-3-31 02:32 作者: 清楚 時(shí)間: 2025-3-31 06:09
Plan Generation by Linear Proofs: On Semantics, which integrates such changes in the form of transition rules into a classical logic framework. This paper presents three ways towards the semantics for this calculus. First, we prove its soundness through a translation into a suitable situational calculus. Second, we interpret it in a particular 作者: Myocyte 時(shí)間: 2025-3-31 11:57 作者: insurrection 時(shí)間: 2025-3-31 15:54
Detecting Redundancy Caused by Congruent Links in Clause Graphsh this order is irrelevant Performing all possible resolutions thus leads to the generation of identical clauses. Hyperresolution is an approach that overcomes part of this problem. Still, there are well known examples for the deduction of identical clauses by permuting the order of resolution steps作者: exigent 時(shí)間: 2025-3-31 21:07
An Approach to Parallel Unification Using Transputersare used for the representation of the terms to be unified. The runtime consumption of the proposed algorithm is in the worst case of order .(./2), where . is the number of nodes in the dag. In the best case, however, the runtime is only of order .(log .)..The algorithm consists of two parts to be e作者: 確保 時(shí)間: 2025-3-31 23:34 作者: ventilate 時(shí)間: 2025-4-1 05:35 作者: appall 時(shí)間: 2025-4-1 09:00
Linear Paramodulation modulo Equalityional equational theory and a conditional equational program. Simple examples from deduction systems motivate our approach. We formally define the calculus for generalized equational programs which is based on the inference rules E-paramodulation and E-reflection. This calculus is proven to be sound
