標(biāo)題: Titlebook: Analogical and Inductive Inference; International Worksh Klaus P. Jantke Conference proceedings 1989 Springer-Verlag Berlin Heidelberg 1989 [打印本頁] 作者: Suture 時間: 2025-3-21 16:37
書目名稱Analogical and Inductive Inference影響因子(影響力)
書目名稱Analogical and Inductive Inference影響因子(影響力)學(xué)科排名
書目名稱Analogical and Inductive Inference網(wǎng)絡(luò)公開度
書目名稱Analogical and Inductive Inference網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Analogical and Inductive Inference被引頻次
書目名稱Analogical and Inductive Inference被引頻次學(xué)科排名
書目名稱Analogical and Inductive Inference年度引用
書目名稱Analogical and Inductive Inference年度引用學(xué)科排名
書目名稱Analogical and Inductive Inference讀者反饋
書目名稱Analogical and Inductive Inference讀者反饋學(xué)科排名
作者: jettison 時間: 2025-3-21 23:28 作者: 地名表 時間: 2025-3-22 01:19 作者: maladorit 時間: 2025-3-22 06:03
https://doi.org/10.1007/978-3-642-45692-3ed to guide the transformation process. In this paper, we further explore this insight and show how examples can be used to guide other kinds of program transformation, guiding not only the unfolding, but also the introduction of new predicates and the folding. On the other hand, we illustrate the m作者: commodity 時間: 2025-3-22 09:50
P. Astuti,M. Corless,D. Williamsonls which are as representation independent as possible. We review this development and discuss the advantages of representation independence. Motivated by the research in learning, we propose a framework for studying the combinatorial properties of representations.作者: Integrate 時間: 2025-3-22 13:26
G. J. Boertjens,W. T. Van Horssenroximation, we accounted for the difficulty of deciding membership in the set points comprising the variance. Our results indicate that the more complex a decision procedure is allowed, the larger the class of functions that become inferrible.作者: 小官 時間: 2025-3-22 20:28 作者: Flatter 時間: 2025-3-22 21:28
Nonlinear Systems: Global Theory,te acceptors. The main technical contribution of this paper is a polynomial algortihm that learns a sub-class of the .-regular languages from queries and counter-examples. A similar setting has been suggested in [Ang87] for learning (finitary) regular languages. The algorithm given there produces th作者: 同時發(fā)生 時間: 2025-3-23 04:18 作者: 不規(guī)則的跳動 時間: 2025-3-23 08:52 作者: 培養(yǎng) 時間: 2025-3-23 13:28
Differential Equations and Dynamical Systemstances of the hypothesis to be learned, but rather instances of a . (i.e., a typical member of the extension) of the hypothesis to be learned. The paradigm is introduced by means of an example problem from the field of conceptual modeling. We analyse the reasons why a naive solution to that problem 作者: doxazosin 時間: 2025-3-23 17:01 作者: exostosis 時間: 2025-3-23 19:18
Three-dimensional inverse scattering,a proof. An interesting proposal in this direction is Alan Bundy‘s approach of using explicit proof plans that encapsulate the general form of a proof and is instantiated into a particular proof for the case at hand. We give some examples that show how a “declarative” highlevel description of a proo作者: Aids209 時間: 2025-3-24 01:52
Patricia Anderson,Stephen R. Bernfelder understanding of analogical reasoning as well as its relationship to existing logical models of nonmonotonic reasoning..We begin with a brief description of a hypothetical reasoning system called Theorist. Theorist is a nonmonotonic clausal theorem prover that permits consistent instances of hypo作者: Airtight 時間: 2025-3-24 03:44
P. Avudai Selvi,Ramanujam Narasimhanm the practical as well as the theoretical point of view..Instead of this strategy we propose a formalization of analogical reasoning, which leads for second order expert systems to a case oriented strategy. In some areas of artificial intelligence certain approaches to the formalization of analogy 作者: Bph773 時間: 2025-3-24 09:54 作者: 粉筆 時間: 2025-3-24 13:44 作者: 使更活躍 時間: 2025-3-24 15:55 作者: 智力高 時間: 2025-3-24 22:56
P. Astuti,M. Corless,D. Williamsonls which are as representation independent as possible. We review this development and discuss the advantages of representation independence. Motivated by the research in learning, we propose a framework for studying the combinatorial properties of representations.作者: enlist 時間: 2025-3-25 02:35 作者: ARM 時間: 2025-3-25 07:15 作者: 外形 時間: 2025-3-25 11:00
https://doi.org/10.1007/3-540-51734-0Analoges Schlie?en; Expertensysteme; Induktive Inferenz; Maschinelles Lernen; Programmsynthese; artificia作者: Armada 時間: 2025-3-25 13:10 作者: Countermand 時間: 2025-3-25 19:06
Why and how program synthesis?,this problem. Even though theoretical reasons are well-known, we provide a detailed analysis of the practical reasons why a formal specification may be hard to program in PROLOG. All that contributes to the clarification of the exact role of PS in AI and in Software Engineering, and its possible application to software certification.作者: 蒼白 時間: 2025-3-25 23:30
Towards representation independence in PAC learning,ls which are as representation independent as possible. We review this development and discuss the advantages of representation independence. Motivated by the research in learning, we propose a framework for studying the combinatorial properties of representations.作者: 抒情短詩 時間: 2025-3-26 00:51 作者: Cacophonous 時間: 2025-3-26 08:00 作者: INCH 時間: 2025-3-26 10:50
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/155889.jpg作者: 木質(zhì) 時間: 2025-3-26 14:04
C. Castillo-Chavez,S. BusenbergThis paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferred, and highlight a number of interesting approaches in computational learning theory.作者: Erythropoietin 時間: 2025-3-26 19:46 作者: 氣候 時間: 2025-3-26 23:02 作者: BOAST 時間: 2025-3-27 03:16 作者: 蛤肉 時間: 2025-3-27 07:26
Patricia Anderson,Stephen R. BernfeldAnalogical inference and inductive inference are processes which achieve roughly the same end (the development of new knowledge) via rather different means. But what is the relationship between these two processes? The current paper suggests that, in the context of the structure-mapping model of analogy作者: 令人發(fā)膩 時間: 2025-3-27 11:14
Inductive inference, DFAs, and computational complexity,This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferred, and highlight a number of interesting approaches in computational learning theory.作者: misshapen 時間: 2025-3-27 14:02
Learning context-free languages efficiently,This paper reports some of the recent results in Japan, focussing on the . of .. The paper does not intend the thorough survey on this topic, rather intend to provide extended abstracts of . results developed in .. The contents of the present paper are as follows:作者: integrated 時間: 2025-3-27 19:35
Inductive inference up to immune sets,We consider approximate in the limit of G?del numbers for total recursive functions. The set of possible errors is allowed to be infinite but “effectively small”. The latter notion is precise in several ways, as “immune”, “hyperimmune”, “hyperhyperimmune”, “cohesive”, etc. All the identification types considered turn out to the different.作者: Brocas-Area 時間: 2025-3-28 01:55 作者: 遷移 時間: 2025-3-28 05:52
Analogical inference as generalised inductive inference,Analogical inference and inductive inference are processes which achieve roughly the same end (the development of new knowledge) via rather different means. But what is the relationship between these two processes? The current paper suggests that, in the context of the structure-mapping model of analogy作者: Cultivate 時間: 2025-3-28 07:17 作者: 魅力 時間: 2025-3-28 11:28 作者: RODE 時間: 2025-3-28 14:56
Towards representation independence in PAC learning,ls which are as representation independent as possible. We review this development and discuss the advantages of representation independence. Motivated by the research in learning, we propose a framework for studying the combinatorial properties of representations.作者: strain 時間: 2025-3-28 21:47 作者: LINES 時間: 2025-3-29 00:22
Refined query inference,inally synthesized programs may have anomalies. Thereby we could show that even questions involving only one type of quantifier may aid the learning process in two directions. First, the number of mind changes can be reduced, and second, more function classes become inferrible. On the other hand, th作者: Induction 時間: 2025-3-29 04:44 作者: Virtues 時間: 2025-3-29 11:08 作者: 妨礙 時間: 2025-3-29 13:28
Nested hyper-rectangles for exemplar-based learning,which these points are generalized to become hyper-rectangles. These hyper-rectangles, in turn, may be nested to arbitrary depth inside one another. This representation scheme is sharply different from the usual inductive learning paradigms, which learn by replacing boolean formulae by more general 作者: 使激動 時間: 2025-3-29 17:22
Second-order inductive learning,tances of the hypothesis to be learned, but rather instances of a . (i.e., a typical member of the extension) of the hypothesis to be learned. The paradigm is introduced by means of an example problem from the field of conceptual modeling. We analyse the reasons why a naive solution to that problem 作者: overweight 時間: 2025-3-29 22:43
Modes of analogy,different modes of “analogy” and talking about it as if it were just one process. First of all, I have emphasized the underlying process of . that plays a key role in analogy by rendition and certain proportional analogy relations. In understanding and modeling this process lies one half of the prob作者: VALID 時間: 2025-3-29 23:58 作者: invade 時間: 2025-3-30 06:01
A sketch of analogy as reasoning with equality hypotheses,er understanding of analogical reasoning as well as its relationship to existing logical models of nonmonotonic reasoning..We begin with a brief description of a hypothetical reasoning system called Theorist. Theorist is a nonmonotonic clausal theorem prover that permits consistent instances of hypo作者: dermatomyositis 時間: 2025-3-30 08:59 作者: companion 時間: 2025-3-30 14:15 作者: OATH 時間: 2025-3-30 17:50
https://doi.org/10.1007/978-3-642-45692-3am transformation, guiding not only the unfolding, but also the introduction of new predicates and the folding. On the other hand, we illustrate the more fundamental restructuring which is possible with program transformation and the relevance of completeness results to eliminate computationally inefficient knowledge.作者: DEFER 時間: 2025-3-30 21:46
https://doi.org/10.1007/978-1-4684-0249-0rocess in two directions. First, the number of mind changes can be reduced, and second, more function classes become inferrible. On the other hand, the Theorems 6 and 15 show that the learning potential of QIMs does mainly depend on the complexity of the allowed questions measured in the number of involved quantifiers.作者: 修正案 時間: 2025-3-31 02:26
Differential Equations and Dynamical Systemsadigm is introduced by means of an example problem from the field of conceptual modeling. We analyse the reasons why a naive solution to that problem is not fully satisfactory by studying the .. Once it is clear why this model is not directly applicable, we attempt to restore it by defining the notion of a ..作者: 譏笑 時間: 2025-3-31 05:21
Some thoughts on the role of examples in program transformation and its relevance for explanation-bam transformation, guiding not only the unfolding, but also the introduction of new predicates and the folding. On the other hand, we illustrate the more fundamental restructuring which is possible with program transformation and the relevance of completeness results to eliminate computationally inefficient knowledge.作者: 高度 時間: 2025-3-31 12:33
Refined query inference,rocess in two directions. First, the number of mind changes can be reduced, and second, more function classes become inferrible. On the other hand, the Theorems 6 and 15 show that the learning potential of QIMs does mainly depend on the complexity of the allowed questions measured in the number of involved quantifiers.作者: 1FAWN 時間: 2025-3-31 17:14
Second-order inductive learning,adigm is introduced by means of an example problem from the field of conceptual modeling. We analyse the reasons why a naive solution to that problem is not fully satisfactory by studying the .. Once it is clear why this model is not directly applicable, we attempt to restore it by defining the notion of a ..作者: 使虛弱 時間: 2025-3-31 17:43 作者: 脾氣暴躁的人 時間: 2025-4-1 00:32 作者: 古代 時間: 2025-4-1 04:00 作者: conquer 時間: 2025-4-1 06:47
Some aspects of analogy in mathematical reasoning,a powerful tool it is necessary to develop an epistemologically appropriate language to describe proofs, for which a large set of examples should be used as a testbed. We present some ideas in this direction.作者: 徹底檢查 時間: 2025-4-1 11:55
,Learning ω-regular languages from queries and counter-examples (a preliminary report),e minimal automaton accepting the desired language using polynomially many (in the number of states) queries and computation steps. Our algorithm tackles some special problems that arise when adapting this framework to the infinitary case.
