派博傳思國際中心

標題: Titlebook: GWAI-92: Advances in Artificial Intelligence; 16th German Conferen Hans Jürgen Ohlbach Conference proceedings 1993 Springer-Verlag Berlin H [打印本頁]

作者: enamel 時間: 2025-3-21 20:09
書目名稱GWAI-92: Advances in Artificial Intelligence影響因子(影響力)

書目名稱GWAI-92: Advances in Artificial Intelligence影響因子(影響力)學科排名

書目名稱GWAI-92: Advances in Artificial Intelligence網(wǎng)絡公開度

書目名稱GWAI-92: Advances in Artificial Intelligence網(wǎng)絡公開度學科排名

書目名稱GWAI-92: Advances in Artificial Intelligence被引頻次

書目名稱GWAI-92: Advances in Artificial Intelligence被引頻次學科排名

書目名稱GWAI-92: Advances in Artificial Intelligence年度引用

書目名稱GWAI-92: Advances in Artificial Intelligence年度引用學科排名

書目名稱GWAI-92: Advances in Artificial Intelligence讀者反饋

書目名稱GWAI-92: Advances in Artificial Intelligence讀者反饋學科排名

作者: MILK 時間: 2025-3-21 20:59
https://doi.org/10.1057/9780230607132 these discontinuities imply severe difficulties in learning cumulative evaluation functions. The discontinuities we detected might also explain why recent applications of reinforcement learning systems to complex tasks [12] failed to show desired performance. In our conclusion, we outline some ideas to circumvent the problem.

作者: Canvas 時間: 2025-3-22 01:48
Cases as a basis for knowledge acquisition in the pre-formal phases of knowledge engineering,case starting with an informal case description and transforms it, step by step, into a formal one. The case descriptions are based on a domain independent case model that has five components: context, problem, solution trace, solution and evaluation of the solution. They are instantiated and refined as the formalization proceeds.

作者: nostrum 時間: 2025-3-22 06:52

作者: neoplasm 時間: 2025-3-22 09:00

作者: 喧鬧 時間: 2025-3-22 14:35
0302-9743 rlinfrom August 31 to September3, 1992. The volume contains 24 papers presentedin thetechnical sessions, 8 papers selected from the workshopcontributions, and an invited talk by D.M. Gabbay entitled"Howto construct a logic for your application".Topics discussed in the technical papers include: a mod

作者: 喧鬧 時間: 2025-3-22 17:15
https://doi.org/10.1007/978-94-015-8185-1s alternatives modal logic or substructural logic are completely satisfactory. We argue that there is a need for a new discipline and introduce and discuss the discipline of .. The approach is to see what is needed from the application area upward into the theory, without imposing any pre-determined concepts.

作者: cumulative 時間: 2025-3-22 23:20

作者: 娘娘腔 時間: 2025-3-23 04:21

作者: 有害處 時間: 2025-3-23 07:59

作者: 大吃大喝 時間: 2025-3-23 10:11

作者: ARCHE 時間: 2025-3-23 14:28

作者: 出汗 時間: 2025-3-23 20:52
Viewing knowledge engineering as a symbiosis of , and ,,roduce the operational modeling language OMOS and to show how it copes with them. Finally, we compare OMOS to two important current developments: PROTéGé-II and SBF (Spark, Burn, Firefighter). This allows us to situate our work and put it into the context of current research.

作者: BAIT 時間: 2025-3-23 22:38

作者: 咯咯笑 時間: 2025-3-24 04:10
A heuristic inductive generalization method and its application to VLSI-design,EFT evaluates the quality of each generated MSG using weighted predicates. The algorithm distinguishes between important and less-important predicates. Built-in predicates are used to improve the resulting hypothesis. The system has been applied successfully to chip-floorplanning — a subtask of VLSI-design.

作者: Immunization 時間: 2025-3-24 08:08

作者: 否決 時間: 2025-3-24 10:52
Saumya M. Shah,Darius M. Moshfeghit compared to deductions in the unsorted resolution calculus. The approach is a conservative extension of the known sorted approaches, as it simplifies to the known sorted calculi if we apply the calculus to the much more restricted input formulas of these calculi.

作者: 浮雕寶石 時間: 2025-3-24 18:07
https://doi.org/10.1007/978-1-349-03777-3r-defined assumptions..In this paper, a basic algorithm for computing elementary solutions is presented, and for reasons of efficiency a modification of this algorithm is explained. In this way, we get an efficient computation of elementary solutions for contradictory time interval networks.

作者: Vldl379 時間: 2025-3-24 22:02

作者: nonsensical 時間: 2025-3-25 01:22

作者: Infinitesimal 時間: 2025-3-25 04:02

作者: 債務 時間: 2025-3-25 10:29
A new sorted logic,t compared to deductions in the unsorted resolution calculus. The approach is a conservative extension of the known sorted approaches, as it simplifies to the known sorted calculi if we apply the calculus to the much more restricted input formulas of these calculi.

作者: addition 時間: 2025-3-25 13:34
Efficient computation of solutions for contradictory time interval networks,r-defined assumptions..In this paper, a basic algorithm for computing elementary solutions is presented, and for reasons of efficiency a modification of this algorithm is explained. In this way, we get an efficient computation of elementary solutions for contradictory time interval networks.

作者: amputation 時間: 2025-3-25 16:02
Extensions of concept languages for a mechanical engineering application,t subsumption problem is undecidable. It should be noted that the need for these extensions is not particular to the considered problem domain; similar representation demands are likely to occur in other non-toy applications.

作者: 遷移 時間: 2025-3-25 20:08
Concept support as a method for programming neural networks with symbolic knowledge,s believed to be essential for the task. Thus the knowledge actually accessible for the neural network remains distributed or -as it is called-subsymbolic. Results from a test application are reported which show considerable improvements in generalization.

作者: 紋章 時間: 2025-3-26 01:04
Learning plan abstractions,odology is applied to learn from machine-oriented programs. An abstract program can be acquired on a higher programming level which is characterized through the use of abstract data types instead of machine-oriented data representations.

作者: 名字 時間: 2025-3-26 07:55
https://doi.org/10.1007/978-3-030-32142-0code area into a backward and forward code area and by adding a new stack to record derived facts. This shows how an efficient implementation of meta-interpreters can have an effect on compilation and even on the design of the target machine.

作者: 農(nóng)學 時間: 2025-3-26 10:05

作者: senile-dementia 時間: 2025-3-26 16:23
https://doi.org/10.1007/BFb0018988Distributed AI Systems; Knowledge Representation; Logic Programming; Machine Learning; Natürlichsprachli

作者: Congregate 時間: 2025-3-26 20:48
Laws, Levels of Descriptions, and Models,oleinized formula is first transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can finally be run as a Prolog program trying to refute the initial formula. It is also possible to precompile axiomatizations into Prolog and load these theories as required.

作者: 注意力集中 時間: 2025-3-26 23:07
Reconciling Gender and Rationality, this field. Oriented to our conceptual framework of knowledge transformation, some trip wires which can seriously jeopardize the success of expert-system-developing projects are described in the following.

作者: 易于交談 時間: 2025-3-27 01:43
Towards first-order deduction based on Shannon graphs,oleinized formula is first transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can finally be run as a Prolog program trying to refute the initial formula. It is also possible to precompile axiomatizations into Prolog and load these theories as required.

作者: 相同 時間: 2025-3-27 05:44

作者: 分開如此和諧 時間: 2025-3-27 10:54
978-3-540-56667-0Springer-Verlag Berlin Heidelberg 1993

作者: Spartan 時間: 2025-3-27 15:27

作者: gentle 時間: 2025-3-27 18:01
https://doi.org/10.1007/978-94-015-8185-1tation in his application area. We examine two case studies, modal logic and resurce logics and show that in both cases neither classical logic nor its alternatives modal logic or substructural logic are completely satisfactory. We argue that there is a need for a new discipline and introduce and di

作者: 矛盾 時間: 2025-3-28 00:02

作者: CLOWN 時間: 2025-3-28 02:57
Antonio Zicca,Alberto Tagliaficouctive competence. Our goal is primarily twofold. For one thing, it is aimed to establish an explanatory framework for human theorem proving. Devised as a computational theory, for another thing, it should also set up a theoretical foundation for deductive systems which simulate the way in which hum

作者: 云狀 時間: 2025-3-28 09:47
Laws, Levels of Descriptions, and Models,oleinized formula is first transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can finally be run as a Prolog program trying to refute the initial formula. It is also possible to precompile axiomatizations into Prolog and load these theories as required.

作者: 硬化 時間: 2025-3-28 12:22

作者: 諷刺 時間: 2025-3-28 18:22
https://doi.org/10.1007/978-3-030-02880-0ments that support this view on modeling and that exploit the symbiosis of both facets: ., ., and .. We use the framework of these requirements to introduce the operational modeling language OMOS and to show how it copes with them. Finally, we compare OMOS to two important current developments: PROT

作者: 樹膠 時間: 2025-3-28 20:40
Terms, Concept and Concept-Clusters, the knowledge acquisition process—occurring in the transition from the informal knowledge to a formalized knowledge base—is one reason for lacking documentation. The system UFA supports and documents knowledge modelling and formalization of case-based knowledge. The knowledge engineer formalizes a

作者: 刺耳的聲音 時間: 2025-3-29 00:54
A Reader’s Guide to the Plays of W. B. Yeatsy time, returning a result that is more accurate the more time has been available. They allow the introduction of time as a new dimension into stop criteria. We can now define a system‘s utility in terms of the quality of its results and the time required to produce them. However, optimising utility

作者: 偽善 時間: 2025-3-29 06:17

作者: crutch 時間: 2025-3-29 08:20
A Reading of Gilles Deleuze’s Logic of Senseconventional concept language poses two main representation problems. The first requires access to concrete domains, such as real numbers, while the second asks for a construct which can be used to represent sequences of varying length. As shown in recent papers by the authors there exist extended c

作者: 多節(jié) 時間: 2025-3-29 13:55

作者: Comedienne 時間: 2025-3-29 18:14

作者: Uncultured 時間: 2025-3-29 21:41
https://doi.org/10.1007/978-94-017-0596-7eural networks, however, symbolic knowledge does exist which describes a large number of cases relatively well, or at least contributes to partial solutions. From a practical point of view it appears to be a waste of resources to give up this knowledge altogether by training a network from scratch.

作者: enormous 時間: 2025-3-30 03:41