標(biāo)題: Titlebook: EPIA‘91; 5th Portuguese Confe Pedro Barahona,Luís Moniz Pereira,António Porto Conference proceedings 1991 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: HAVEN 時(shí)間: 2025-3-21 18:40
書目名稱EPIA‘91影響因子(影響力)
書目名稱EPIA‘91影響因子(影響力)學(xué)科排名
書目名稱EPIA‘91網(wǎng)絡(luò)公開度
書目名稱EPIA‘91網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱EPIA‘91被引頻次
書目名稱EPIA‘91被引頻次學(xué)科排名
書目名稱EPIA‘91年度引用
書目名稱EPIA‘91年度引用學(xué)科排名
書目名稱EPIA‘91讀者反饋
書目名稱EPIA‘91讀者反饋學(xué)科排名
作者: 諄諄教誨 時(shí)間: 2025-3-21 22:15
The extended stable models of contradiction removal semantics, a single common framework..The Contradiction Free Extended Stable Semantics is an extension to the definition of Contradiction Removal Semantics, provided here in a form independent from the Well Founded Semantics, in terms of a fixpoint operator, instead of in terms of the Well Founded Semantics o作者: 不遵守 時(shí)間: 2025-3-22 03:04
Semantics of property inheritance in a hierarchic system with explicit negation,t is meant by validity of formulas in such structures..The inheritance mechanism is able to choose from a set of inherited default properties which ones must be overriden in order to guarantee that the local program has a model..The notion of characteristic individuals of classes, introduced in our 作者: maladorit 時(shí)間: 2025-3-22 05:27
Time in confluences: Dealing with delays for consistency-checking,t from an implementation in Prolog called C-CAT (Consistency-Checking Along Time)..The solution proposed represents an extension to Brian Williams‘ Temporal Constraint Propagation methodology. It also extends the applicability range of existing approaches to model-based diagnosis, permitting its use作者: Creatinine-Test 時(shí)間: 2025-3-22 11:48 作者: Lyme-disease 時(shí)間: 2025-3-22 16:33 作者: Lyme-disease 時(shí)間: 2025-3-22 17:16 作者: 消音器 時(shí)間: 2025-3-22 22:26
on, and shows how the query language can be viewed as an instance of the scheme. This constraint system is the basis of a constraint logic programming system dealing with type information as described by taxonomies.作者: Esalate 時(shí)間: 2025-3-23 01:26 作者: 野蠻 時(shí)間: 2025-3-23 05:38 作者: AMOR 時(shí)間: 2025-3-23 10:00
https://doi.org/10.1007/978-3-319-73272-5t from an implementation in Prolog called C-CAT (Consistency-Checking Along Time)..The solution proposed represents an extension to Brian Williams‘ Temporal Constraint Propagation methodology. It also extends the applicability range of existing approaches to model-based diagnosis, permitting its use作者: Brocas-Area 時(shí)間: 2025-3-23 15:07
Public Health and Social Services,e to the design of the inference mechanism. We present here the syntax and declarative semantics of a propositional version of the language of maximal intervals and a first discussion of the problems in designing an inference system adequate to work with this temporal framework.作者: Narcissist 時(shí)間: 2025-3-23 18:09 作者: 危險(xiǎn) 時(shí)間: 2025-3-24 00:32 作者: Motilin 時(shí)間: 2025-3-24 03:38 作者: GLARE 時(shí)間: 2025-3-24 08:17
Towards a theory of the repair process,quate in many applications. We will then describe several key concepts necessary for a theory of a repair process and give a general definition of the repair process. Finally, we analyze the special case of component oriented repair and briefly mention how these concepts can enhance a conventional diagnosis system.作者: myopia 時(shí)間: 2025-3-24 13:00
A neural approach to data compression and classification,fication of a neural system to perform in a wide range of application environments. This paper presents the ., a neural network model designed for . and solution of classification problems. Classification of hand-written digits is used to demonstrate its performance.作者: 肌肉 時(shí)間: 2025-3-24 16:30
, the ., for which the set of successful derivations covers the set of non-negative solutions of the associated system. This definition is based on a study of cycles in context-free grammars using compiler construction concepts and techniques.作者: radiograph 時(shí)間: 2025-3-24 23:04
mance of PBA* by dynamically redirecting the local search processes that run concurrently on PBA*, toward quick path establishment. Experimental results on a uniprocessor, as well as a multiprocessor machine (Intel iPSC/2 hypercube) demonstrate the viability of the proposed method.作者: cliche 時(shí)間: 2025-3-25 01:41
https://doi.org/10.1007/978-3-662-64395-2ered. A bidirectional chart parsing was implemented in Prolog to express this idea. The results then obtained gave us some rules of thumb to get the best annotation of a grammar rule set and showed us the gain in time analysis by the spectacular pruning (65% in average for any phenomenon) of the search space.作者: 開花期女 時(shí)間: 2025-3-25 05:07 作者: 臭了生氣 時(shí)間: 2025-3-25 10:11 作者: 清洗 時(shí)間: 2025-3-25 14:01
Heuristic parsing and search space pruning,ered. A bidirectional chart parsing was implemented in Prolog to express this idea. The results then obtained gave us some rules of thumb to get the best annotation of a grammar rule set and showed us the gain in time analysis by the spectacular pruning (65% in average for any phenomenon) of the search space.作者: 飛鏢 時(shí)間: 2025-3-25 18:34 作者: 最初 時(shí)間: 2025-3-25 23:03 作者: Parabola 時(shí)間: 2025-3-26 03:31
Conference proceedings 1991since 1985.This volume contains selected papers from the FifthConference on Artificial Intelligence. The conference has aninternational status: 62 contributions from 13 countrieswerereceived, of which 26 were from Portugal. To guaranteea high scientificstandard, all the contributions werereviewed by作者: athlete’s-foot 時(shí)間: 2025-3-26 06:25 作者: commensurate 時(shí)間: 2025-3-26 10:35 作者: Accolade 時(shí)間: 2025-3-26 13:28
Conference proceedings 1991 at least three researchers,and only 20 paperswere accepted and included in these proceedings. The papersare organized into sections on constraints, search,knowledgerepresentation, temporal reasoning, planning,diagnosis and repair, and learning.作者: ingestion 時(shí)間: 2025-3-26 17:34
0302-9743 eviewed by at least three researchers,and only 20 paperswere accepted and included in these proceedings. The papersare organized into sections on constraints, search,knowledgerepresentation, temporal reasoning, planning,diagnosis and repair, and learning.978-3-540-54535-4978-3-540-38459-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Harrowing 時(shí)間: 2025-3-26 23:35
0302-9743 condyear, since 1985.This volume contains selected papers from the FifthConference on Artificial Intelligence. The conference has aninternational status: 62 contributions from 13 countrieswerereceived, of which 26 were from Portugal. To guaranteea high scientificstandard, all the contributions werer作者: gratify 時(shí)間: 2025-3-27 01:26 作者: 1分開 時(shí)間: 2025-3-27 08:06 作者: dyspareunia 時(shí)間: 2025-3-27 12:07
Postface: Theorizing Polyracism,fication of a neural system to perform in a wide range of application environments. This paper presents the ., a neural network model designed for . and solution of classification problems. Classification of hand-written digits is used to demonstrate its performance.作者: cajole 時(shí)間: 2025-3-27 15:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/300465.jpg作者: grotto 時(shí)間: 2025-3-27 19:41
r constraints on finite domains. Solving this kind of constraints is equivalent to solving systems of linear Diophantine equations on a finite subset of the naturals. We associate, to such a system, a definite-clause grammar that can be used to enumerate its solutions, and define a class of grammars作者: 使糾纏 時(shí)間: 2025-3-27 23:53
erful than normal unification. However, these capabilities are usually general-purpose and embedded in the language. In this paper we make a case for extending the user interaction with the constraint solver, namely to achieve better performances. More specifically we present for finite domains, an 作者: indecipherable 時(shí)間: 2025-3-28 04:46 作者: endarterectomy 時(shí)間: 2025-3-28 08:01
individuals. A query expressed in the language is either a declarative or an interrogative sentence. Declarative sentences correspond to the usual first-order formulae and require a “yes” or “no” answer. Interrogative sentences are basically declarative sentences with some variables stipulated as “作者: Gourmet 時(shí)間: 2025-3-28 13:09 作者: doxazosin 時(shí)間: 2025-3-28 18:20
hm in this category to date (PBA*) has been demonstrated to exhibit excellent performance in practice (superlinear speedup in all tested cases) [Nels90d]. This paper introduces the concept of wave-shaping for parallel bidirectional heuristic island search. The resulting algorithm improves the perfor作者: oblique 時(shí)間: 2025-3-28 21:59
The Enforceability of Mediation Agreementscs, thus providing the notion of Contradiction Free Extended Stable Models. Contradiction Removal Semantics extends Well Founded Semantics to deal with contradictions arising from the introduction of classical negation. Because the Extended Stable Models structure of a program is useful for expressi作者: Lethargic 時(shí)間: 2025-3-29 02:38 作者: 藥物 時(shí)間: 2025-3-29 04:39
verriding (all definitions being taken as defaults) and multiple inheritance. The overriding is based on the explicit statement of negative information..The basic entities are classes and properties. The system is hierarchic because it is made out of classes which are structured as a hierarchy. We c作者: morale 時(shí)間: 2025-3-29 09:15 作者: NADIR 時(shí)間: 2025-3-29 13:32
Noam Yarom DMD,Stefano Fedele DDS, PhDlligence and of execution control. Planning formalisms are often founded on predicate logic and its more recent extensions, particularly temporal logic. Robot programming languages, as far as concerning the task-level, feature control structures derived from computer programming languages, as well a作者: ferment 時(shí)間: 2025-3-29 19:14 作者: RLS898 時(shí)間: 2025-3-29 22:21 作者: colostrum 時(shí)間: 2025-3-30 01:36
,Die Sucht nach der ?ffentlichkeit,ied robotic environments. However, the application of such algorithms to real assembly tasks fail since the usual approach, restrictive to the blocks world, is too poor to be generalized for real-life robotic problems. On the other hand, these algorithms are very expensive to be applied on Robotics,作者: 哀悼 時(shí)間: 2025-3-30 04:32
Mediendiskurs Islam: Zur Theorie,l-based diagnosis so far has been dealing only with the replacement of all components in a diagnosis as a repair action which we will show to be inadequate in many applications. We will then describe several key concepts necessary for a theory of a repair process and give a general definition of the作者: 遺留之物 時(shí)間: 2025-3-30 10:08
vation is to build declarative debuggers requiring less oracle queries, at the cost of loosing information about the variable bindings of the diagnosis. This new approach we call ., as opposed to ...A motivating example for pure Prolog is given, consisting of an append computation with a wrong solut作者: deadlock 時(shí)間: 2025-3-30 15:53 作者: 指派 時(shí)間: 2025-3-30 17:33 作者: 傳授知識 時(shí)間: 2025-3-30 23:30 作者: insurrection 時(shí)間: 2025-3-31 03:37 作者: 赦免 時(shí)間: 2025-3-31 05:46 作者: 宮殿般 時(shí)間: 2025-3-31 12:46
A constraint-based fuzzy inference system,This paper describes an inference system for uncertain predicates, providing an alternative to the maximal entropy method used by Paris and Vencovska in.In the Appendix we give an example of the application of the process, and a formal definition of the logics that underlie the system.作者: Allure 時(shí)間: 2025-3-31 17:09
https://doi.org/10.1007/3-540-54535-2Automated Deduction; Automated Theorem Proving; Automatisches Beweisen; Automatisches Schlie?en; Fuzzy; K作者: 外來 時(shí)間: 2025-3-31 21:28 作者: 摸索 時(shí)間: 2025-3-31 22:21
A new method for solving linear constraints on the natural numbers,numbers, a problem that is also of great importance in AC-unification. We describe a new algorithm that is faster than the methods we compared it with, and that may well contradict the view that this kind of algorithms is too expensive to be of practical use, for instance in the implementation of Constraint Logic Programming languages.
