作者: AROMA 時間: 2025-3-21 21:44
978-3-540-63494-2Springer-Verlag Berlin Heidelberg 1997作者: OGLE 時間: 2025-3-22 00:45 作者: 冒失 時間: 2025-3-22 05:36
Relational knowledge discovery in databases,for adapting and linking ILP-systems to relational database systems. The proposed methods range from “pure ILP” to “based on techniques originating in ILP” We show that it is both easy and advantageous to adapt ILP-systems in this way.作者: 小母馬 時間: 2025-3-22 09:01
https://doi.org/10.1007/3-540-63494-0inductive learning; inductive logic programming; learning; logic; machine learning; natural language proc作者: anthropologist 時間: 2025-3-22 15:19 作者: Torrid 時間: 2025-3-22 18:26
Applying ILP to diterpene structure elucidation from 13C NMR spectra,ng was successfully applied to learn classification rules from spectra with assigned atom numbers. As the assignment of atom numbers is a difficult process in itself (and possibly indistinguishable from the classification process), we apply ILP, i.e., relational learning, to the problem of classifyi作者: GRATE 時間: 2025-3-22 22:38
Feature construction with inductive logic programming: A study of quantitative predictions of bioloWhen both are applicable, ILP programs are usually slower than their propositional counterparts. This paper examines the use of ILP programs, not for obtaining theories complete for the sample, but as a method of “discovering” new attributes. These could then be used by methods like linear regressio作者: alabaster 時間: 2025-3-23 04:41 作者: 通知 時間: 2025-3-23 09:12 作者: Projection 時間: 2025-3-23 11:10
Integrity constraints in ILP using a Monte Carlo approach,ether with) negative examples. As a consequence programs to induce can be specified more rapidly by the user and the ILP system tends to obtain more accurate definitions. Average running times are not greatly affected by the use of integrity constraints compared to ground negative examples.作者: Pedagogy 時間: 2025-3-23 16:04 作者: 古老 時間: 2025-3-23 20:42
Raymond J. Mooneyuations is in PSPACE (Plandowski 1999) and the corresponding result for equations in free groups with rational constraints (Diekert, Hagenah and Gutiérrez 2001). As a byproduct we obtain a?direct proof that it is decidable in PSPACE whether or not the solution set is finite.作者: SLAG 時間: 2025-3-24 01:51
Stephen Muggleton,David Page,Ashwin Srinivasaned typing have appeared in?[., .] and lead naturally to unifying the . and . abstractions?[., .]. The Automath system combined the unification of binders . and . with .- and .-reduction together with a type inclusion rule that allows the different expressions that define the same term to share the s作者: 滑稽 時間: 2025-3-24 04:27
Sa?o D?eroski,Steffen Schulze-Kremer,Karsten R. Heidtke,Karsten Siems,Dietrich Wettschereckoves over the extended Cooley-Tukey FFT for highly composite transform’s length. Rader’s algorithm., on its turn, is designed for computing prime length DFTs. These algorithms, all members of the family of traditional FFTs, reduce the .-point DFT arithmetic complexity from .(..) to .(.).作者: Aerate 時間: 2025-3-24 07:21
Erika Van Baelen,Luc De Raedtof the polygons. A polynomial algorithm for the case of two-dimensional space is also discussed in [7]. Recently, an exact algorithm was developed to determine the time-optimal trajectory in two-dimensional space under kinematic and dynamic constraints [4]. So far, no polynomial algorithm is known f作者: accessory 時間: 2025-3-24 12:58 作者: intolerance 時間: 2025-3-24 16:07
Gabriella Kókai,Zoltán Alexin,Tibor Gyimóthyle more than bring the new technology into the classroom. It assists in deciding whether new tools for education exploit the current state of the art and whether such tools are cognitive ones that embody new approaches to educational practice or simply gee-whiz extensions to existing principles. The作者: 指耕作 時間: 2025-3-24 19:21
Fumio Mizoguchi,Hayato Ohwada,Makiko Daidoji,Shiroteru Shiratoteachers wanting to èdo awayé with conventional lectures by making their lecture notes available to students via the Web. The desire to move away from conventional lectures may well be meritorious but to replace them with a set of notes can hardly be viewed as an improvement in the educational proce作者: 廣告 時間: 2025-3-25 02:56 作者: prostate-gland 時間: 2025-3-25 06:45 作者: 思想 時間: 2025-3-25 09:26 作者: 笨拙的你 時間: 2025-3-25 15:20 作者: interrogate 時間: 2025-3-25 17:22
Tamás Horváth,Robert H. Sloan,Gy?rgy Turán The power of the framework is demonstrated by developing simple and transparent evolving algebra models for the Chemical Abstract Machine of Berry and Boudol and for the .-calculus of Milner. Their respective notions of parallelism map directly and faithfully to native concurrency of evolving algeb作者: 尖 時間: 2025-3-25 23:45
Analyzing and learning ECG waveforms,be used to improve the effectiveness of a real size Prolog application. Applying the IMPUT method, the extended PECG system is able to suggest a correct solution to the user to replace the buggy clause recognized during the debugging process.作者: 按等級 時間: 2025-3-26 02:37 作者: 壓迫 時間: 2025-3-26 04:44 作者: 熱情的我 時間: 2025-3-26 09:08
,Efficient θ-subsumption based on graph algorithms,on of the pruning strategy of the Carraghan and Pardalos clique algorithm provides a dramatic reduction of the subsumption search space. We also present empirical results for the mesh design data set.作者: 顧客 時間: 2025-3-26 13:00
Least generalizations under implication,finite set of clauses which contains at least one non-tautologous function-free clause. We can also define implication relative to background knowledge. In this case, least generalizations only exist in a very limited case.作者: 卵石 時間: 2025-3-26 17:56
Learning Logic programs with random classification noise,edge. Also, we show that arbitrary nonrecursive Horn clauses with forest background knowledge remain polynomially PAC learnable in the presence of noise. We point out that the sample size can be decreased by using dependencies among the literals.作者: Cursory 時間: 2025-3-26 21:34 作者: 凹室 時間: 2025-3-27 04:01
Conference proceedings 1997n Stockholm, Sweden, in August 1996..The 21 full papers were carefully reviewed and selected for inclusion in the book in revised version. Also included is the invited contribution "Inductive logic programming for natural language processing" by Raymond J. Mooney. Among the topics covered are natura作者: medium 時間: 2025-3-27 07:27
Analysis and prediction of piano performances using inductive logic programming,nductive logic programming benchmark, but also as a demonstration of the need for multiple predicate learning, sequence prediction and number handling in inductive logic programming. Furthermore, the results presented here can be considered the first original application of the clausal discovery engine Claudien.作者: 暴行 時間: 2025-3-27 13:23
Noise detection and elimination applied to noise handling in a KRK chess endgame,tage that noisy examples do not influence hypothesis construction as opposed to most standard approaches to noise handling in which the learner typically tries to avoid overfitting the noisy example set. Experimental results in a KRK (king-rook-king) chess endgame domain show the potential of this novel approach to noise handling.作者: 連接 時間: 2025-3-27 16:29
Top-down induction of logic programs from incomplete samples,es. Randomly selected incomplete samples are tested with FOIL-I, QuinIan‘s FOIL and Muggleton‘s Progol. Compared with others FOIL-I can induce target relations in many cases from small incomplete samples.作者: adumbrate 時間: 2025-3-27 19:43
Efficient proof encoding,ts the properties of this bias to store the computed answers efficiently. We show that such encoding grows at most linearly with respect to the clause length. The result is not influenced by the presence of nondeterminism in the background knowledge.作者: Factorable 時間: 2025-3-28 00:19
0302-9743 , program synthesis, proof encoding and learning in the absence of negative data, and least generalizations under implication ordering.978-3-540-63494-2978-3-540-69583-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不容置疑 時間: 2025-3-28 05:11
Inductive logic programming for natural language processing,er that . acquired was more accurate than an existing hand-coded system. The paper also includes a discussion of several issues this work has raised regarding the capabilities and testing of ILP systems as well as a summary of our current research directions.作者: Melanocytes 時間: 2025-3-28 10:03
Restructuring chain datalog programs,ssfully applied to a real-world robot navigation domain. Finally, we show that the restructuring method yields a program which can be evaluated faster than the original one. This speed up is achieved by program decompositions.作者: 無能的人 時間: 2025-3-28 11:51
0302-9743 96, held in Stockholm, Sweden, in August 1996..The 21 full papers were carefully reviewed and selected for inclusion in the book in revised version. Also included is the invited contribution "Inductive logic programming for natural language processing" by Raymond J. Mooney. Among the topics covered 作者: CANT 時間: 2025-3-28 17:34
Raymond J. Mooney equations in free groups and monoids with involution in the presence of rational constraints. This became possible due to the recently invented recompression technique of the second author..He successfully applied the recompression technique for pure word equations without involution or rational co作者: Militia 時間: 2025-3-28 19:27 作者: Hemiparesis 時間: 2025-3-28 23:57 作者: 盡責(zé) 時間: 2025-3-29 06:11
Erika Van Baelen,Luc De Raedt various problems in this area. Most existing works obtain algorithmic results, proposing polynomial/exponential algorithms for motion planning under different kinematic and dynamic conditions. Among them, [3] devises a polynomial-time approximation algorithm to compute time-optimal motion in two an作者: REP 時間: 2025-3-29 07:13 作者: 交響樂 時間: 2025-3-29 13:29
Gabriella Kókai,Zoltán Alexin,Tibor Gyimóthyundamental constructivist principles and examines how these principles might establish an increased presence within the future of computer science education. Programming and WWW support tools are given some coverage from a constructivist perspective. In addition, it is proposed that the very rapidit作者: 障礙 時間: 2025-3-29 18:34 作者: 不透明 時間: 2025-3-29 22:16 作者: 使混合 時間: 2025-3-30 02:32
Nobuhiro Inuzuka,Masakage Kamo,Naohiro Ishii,Hirohisa Seki,Hidenori Itohs calculi. Traditional models like synchronisation trees and event structures have been shown to embed fully and faithfully in particular presheaf models in such a way that bisimulation, expressed through the presence of a span of open maps, is conserved. As is shown in the work of Joyal and Moerdij作者: 兩種語言 時間: 2025-3-30 04:25
Shan-Hwei Nienhuys-Cheng,Ronald de Wolflity for the role of a general framework for modeling concurrent computation. As a basic tool we introduce a ‘modal’ logic of transition rules and runs, which is, in the context of evolving algebras, just a definitional extension of ordinary first order logic. A notion of independence of rules and r作者: harbinger 時間: 2025-3-30 09:44
Uro? Pompelity for the role of a general framework for modeling concurrent computation. As a basic tool we introduce a ‘modal’ logic of transition rules and runs, which is, in the context of evolving algebras, just a definitional extension of ordinary first order logic. A notion of independence of rules and r作者: 歡笑 時間: 2025-3-30 12:36
Tamás Horváth,Robert H. Sloan,Gy?rgy Turánlity for the role of a general framework for modeling concurrent computation. As a basic tool we introduce a ‘modal’ logic of transition rules and runs, which is, in the context of evolving algebras, just a definitional extension of ordinary first order logic. A notion of independence of rules and r作者: 我不重要 時間: 2025-3-30 19:09
Inductive logic programming for natural language processing,ed a system, ., that learns a parser from a training corpus of parsed sentences by inducing heuristics that control an initial overly-general shift-reduce parser. CHILL learns syntactic parsers as well as ones that translate English database queries directly into executable logical form. The ATIS co作者: 十字架 時間: 2025-3-30 21:06 作者: Intentional 時間: 2025-3-31 02:54 作者: 陰謀 時間: 2025-3-31 06:30
Analysis and prediction of piano performances using inductive logic programming,usal discovery engine Claudien to induce theories for predicting MIDI files from the musical analysis of a score. This extends Dovey‘s work in several directions: MIDI-encodings are used instead of the older Ampico, a richer musical analysis within LaRue‘s SHMRG-model is applied, a much finer qualit作者: 無可爭辯 時間: 2025-3-31 10:03
Noise detection and elimination applied to noise handling in a KRK chess endgame,tified basis for grading candidate hypotheses. Compression-based induction is appropriate also for handling of noisy data. This paper shows that a simple compression measure can be used to detect noisy examples. A technique is proposed in which noisy examples are detected and eliminated from the tra作者: GROUP 時間: 2025-3-31 16:38 作者: 厚顏 時間: 2025-3-31 20:13
Polynomial-time learning in logic programming and constraint logic programming,r of possible matchings between a candidate hypothesis and a training example..This paper investigates the use of a stochastic bias to control this factor of complexity: the exhaustive exploration of the matching space is replaced by considering a fixed number of matchings, obtained by random sampli作者: Hormones 時間: 2025-3-31 23:00
Analyzing and learning ECG waveforms, is based on an attribute grammar specification of ECGs that has been transformed to Prolog. The IMPUT system combines the interactive debugging technique IDT with the unfolding algorithm introduced in SPECTRE. The main result achieved in the new version of the PECG system is that an ILP method can 作者: 創(chuàng)造性 時間: 2025-4-1 05:43
Learning rules that classify ocular fundus images for glaucoma diagnosis,glaucoma diagnosis. Key issues in this study are not only dealing with low-level measurement data such as image, but also producing diagnostic rules that are readable and comprehensive for interactions to medical experts. For this purpose, we develop a constraintdirected ILP system, GKS, that handle作者: indoctrinate 時間: 2025-4-1 09:33
A new design and implementation of progol by bottom-up computation,tation. Hypothesis formation in Progol, which is performed by top-down computation with Prolog in the sequential implementation, will be performed more efficiently by bottom-up computation with MGTP in the new implementation. For the Progol‘s generalto-specific search for hypotheses through the subs作者: Obloquy 時間: 2025-4-1 13:13 作者: Ornament 時間: 2025-4-1 15:03
