
	Where results make sense

Topic: Golem (ILP)

Related Topics

Whole genome shotgun

Christopher Robert Chope

Railway stations

Mesa 3D

Infant botulism

Lister (disambiguation)

World Poker Tour Walk of Fame

In the News (Wed 30 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Golem - Biocrawler (Site not responding. Last check: 2007-11-03)
		Having a golem servant was seen as the ultimate symbol of wisdom and holiness, and there are many tales of golems connected to prominent rabbis throughout the Middle Ages.
		In 2005, the story of the Golem was returned to its Jewish roots, as a new comic strip in Israeli newspaper Yedioth Ahronoth depicted the Golem as a government-funded superhero protecting Israel from its domestic and existential difficulties.
		The concept of golems and similar automata and simulacra is a popular one, and throughout the history of the hobby of roleplaying games, it has given birth to a vast array of variations upon the theme.
	www.biocrawler.com /encyclopedia/Golem (1227 words)

	Inductive Logic Programming (Site not responding. Last check: 2007-11-03)
		The theory of ILP is based on proof theory and model theory for the first order predicate calculus.
		ILP systems have been applied to various problem domains.
		Golem is based on the construction of relative least general generalisations (rlggs).
	www.doc.ic.ac.uk /~shm/ilp.html (316 words)

	GOLEM (Site not responding. Last check: 2007-11-03)
		Among these rlggs, GOLEM chooses the one which covers the largest number of positive examples and is consistent with the negative examples.
		GOLEM randomly selects a set of positive examples and constructs the rlggs of each of these examples and the clause obtained in the first construction step.
		Therefore, GOLEM imposes some restrictions on the background knowledge and hypothesis language which ensure that the length of rlggs grows at worst polynomially with the number of positive examples.
	www-ai.ijs.si /~ilpnet2/systems/golem.html (400 words)

	Vapor Golem Heart -- Recommendations and Resources (Site not responding. Last check: 2007-11-03)
		It returns the Golem to his original mythical position (in the stories of the Prague golem, at any rate) as a defender of Jews against a dangerous world, thus reconnecting the myth with Jewish ideas of vulnerability.
		Golems on Terry Pratchett's Discworld are derived from golems in Jewish mythology; early forms of a clay robot, supposedly awakened by a spell or priestly words to do people's bidding.
		Technically a charity, it refuses to accept donations from any other than the freed golems, because the golems are clear they must free themselves by their own work.
	www.becomingapediatrician.com /health/156/vapor-golem-heart.html (1017 words)

	Inductive Logic Programming - Theory
		The rlggs constructed by Golem were forced to have only a tractable number of literals by requiring that the set of possible hypotheses contain only definite clause theories that were ij-determinate.
		ILP systems have severe restrictions on the form of numeric constraints that can be used.
		ILP system require the ability to learn and make use of general constraints, rather than requiring large numbers of ground negative examples.
	web.comlab.ox.ac.uk /oucl/research/areas/machlearn/ilp_theory.html (2104 words)

	LATES - ILP Activities (Site not responding. Last check: 2007-11-03)
		In the area of ILP the research of the Laboratory for Technical Software is concentrated to the practical applications of the ILP techniques to the engineering problems, especially in the mechanical engineering domain.
		The ILP application to the finite element mesh design problem was the main project in the last few years in that field.
		ILP algorithm GOLEM was employed to build a knowledge base for determining the resolution values for the finite element mesh, used for the engineering calculations of the stresses and strains in the physical structures [1].
	www.fs.uni-mb.si /en/inst/iko/lates/Research/ILP.html (413 words)

	KLAP Seminar Home Page, Fall 2004
		Second we take the view of ILP problem as the inversion of deduction and present a series of systems which are based directly on the inverse techniques.
		The specification of the ILP problem using first-order logic and a general scheme used to solve the ILP problem, will be presented in the second part of my talk.
		It shows that the ILP problem is a problem of searching the ordered clause space for a correct theory, and specialization and generalization are two key operations needed by the searching process.
	www.cs.nmsu.edu /~ipivkina/KLAP/KLAPfall04.html (1353 words)

	Amund Tveit's Publications
		ILP can be explained more precisely by first describing the concepts of logic programming and induction separately.
		ILP is divided into two major sub fields, interactive ILP and empirical ILP.
		Some areas where ILP is applied: drugs' structure activity rule discoveries, learning rules for predicting protein secondary structure, automated program generation, learning rules for chess playing and in general as a tool for data mining and knowledge discovery in databases (See Lavrac N., Dzeroski S. (1993), Inductive Logic Programming - Techniques and).
	www.amundtveit.info /publications/1997/MScThesis (9600 words)

	[No title]
		An outline of the theory of ILP is given, together with a description of Golem and previous applications of ILP.
		A case-study is then presented in which Golem is used to induce rules which predict, with a high accuracy (82\%), whether each of a series of attempted separations succeed or fail.
		As far as these authors are aware, this is both the first biological grammar learnt using ILP and the first real-world scientific application of the ILP Bayesian approach to learning from positive examples.
	www.netlib.org /bibnet/authors/b/bryant-chris.bib (1359 words)

	Learning rules for finite element mesh design (Site not responding. Last check: 2007-11-03)
		One advantage of ILP is that the examples and rules are expressed in predicate logic, so predicates can be used to describe geometric relations between different elements.
		The problem of learning rules for determining the resolution of a FE mesh is therefore, to learn rules that determine the number of elements on an edge.
		The data files are as used in the original Golem experiments, and are downloadable as one compressed TAR file.
	www.cse.iitd.ernet.in /~ashwin/work/machlearn/ilp/mesh.html (412 words)

	[No title] (Site not responding. Last check: 2007-11-03)
		ILP research in Japan has been conducted actively since it appeared in Europe in 1991.
		This is a three-year project started from 1998 that aims to (1) develop new methods for knowledge discovery, (2) install network environments for knowledge discovery, and (3) establish Discovery Science as a new area of computer science.
		They are developing their own ILP system based on sound operations called Bottom Generalization Method, which is similar to Golem, by Muggleton.
	www.cs.ucy.ac.cy /compulog/issue7/interrel/furukawa.htm (578 words)

	Artificial Intelligence Group Publications List page
		The former are used as background knowledge for the ILP algorithm (P-Progol) and the latter are used as examples for the ILP algorithm.
		ILP is differentiated from most other forms of Machine Learning (ML) both by its use of an expressive representation language and its ability to make use of logically encoded background knowledge.
		In particular, language applications of ILP require revision and extension of a hierarchically defined set of predicates in which the examples are typically only provided for predicates at the top of the hierarchy.
	www-users.cs.york.ac.uk /~caj/publicationsList.html (10093 words)

	Inductive Logic Programming
		Secondly, these three ILP systems do not handle noise well at all, when the detection of sub-events of time series is inherently noisy.
		Thirdly, FOIL and GOLEM do not handle numerical attributes at all, and PROGOL does not do it particularly well, requiring a discretisation stage.
		The net result is that Rodriguez et al have to carefully constrain the search algorithm of the ILP in order to induce reasonable clauses.
	www.cse.unsw.edu.au /~waleed/phd/html/node168.html (567 words)

	[No title]
		ILP is of interest to inductive machine learning researchers as it significantly extends the usual attribute-value respresentation and consequently enlarges the scope of machine learning applications; it is also of interest to logic programming researchers as it extends the basically deductive framework of logic programming with the use of induction.
		On the other hand, the book is a guide/reference for an in-depth study of specific empirical ILP techniques, i.e., using attribute-value learners in an ILP framework and specialization techniques based on FOIL (Chapters 5-6,9-10) and their applications in medicine, mesh design and learning of qualitative models (Chapters 11-13).
		The book will be of interest to engineers, researchers and graduate students in the field of artificial intelligence and database methodology, in particular in machine learning, logic programming, software engineering, deductive databases, and knowledge discovery in databases.
	www.kdnuggets.com /news/93/n6.txt (651 words)

	Introduction (Site not responding. Last check: 2007-11-03)
		The focus of this project is on prediction of protein secondary structures, which are the local arrangements of the amino acids, such as alpha helices and beta sheets and etc. My current objective in this project is to predict alpha helices directly from amino acid sequences, i.e., the primary structure.
		Inductive Logic Programming (ILP), which belongs to machine learning paradigm, is used as the approach to achieve prediction.
		I downloaded their dataset and Golem, the ILP system they used, but I just can not produce any similar results.
	www.cs.nmsu.edu /~cliu/homepage/projects/protein_secondary_structure_prediction/introduction.html (315 words)

	The Prioritized Inductive Logic Programs (Site not responding. Last check: 2007-11-03)
		An example is given to show that some inductive learning algorithm may not be correct in the long run if the limit behavior is not considered.
		It is shown that the GOLEM system is not limit-correct.
		Finally, a limit-correct inductive logic system, called the prioritized GOLEM system, is proposed as a solution.
	www.cs.bris.ac.uk /~ILPnet2/Tools/Reports/Abstracts/2002-ma.html (111 words)

	Learning rules for temporal fault diagnosis in satellites (Site not responding. Last check: 2007-11-03)
		We have applied ILP to a problem within the aerospace industry, namely the diagnosis of power-supply failures in a communications satellite.
		In generating the examples, faults were provoked in all possible components, thus guaranteeing that the rules are complete and correct for all single faults.
		We have developed such a formalism, which is based on temporal logic and which is suitable for ILP learning.
	www.cse.iitd.ernet.in /~ashwin/work/machlearn/ilp/satellite.html (597 words)

	Research grant: Inductive Logic Programming (Site not responding. Last check: 2007-11-03)
		During the course of the proposed fellowship it is intended to integrate ILP methods into the broader framework of software engineering practice.
		Firstly, it is possible in the limit to distinguish between high and low time-complexity solutions by comparing the proof lengths for the given instances.
		The motivation here is that many of the constraints used in existing first-order ILP systems are quite naturally expressed as statements in a higher-order logic.
	www.cs.york.ac.uk /mlg/advanced.html (283 words)

	KDNet - Knowledge Discovery Network of Excellence - Online Information System (Site not responding. Last check: 2007-11-03)
		In [Feng 91], ILP has been applied to a problem within the aerospace industry, namely the diagnosis of power-supply failures in a communications satellite.
		Golem induced a set of rules for diagnosing power supply failures.
		Because the power-supply's behaviour changes with time, the formalism used to describe the examples is based on temporal logic which proves to be suitable for ILP learning.
	www.kdnet.org /kdnet/control/dataset_details?item_id=17&TYPE=dataset (476 words)

	Knowledge mining and bioinformatics (Site not responding. Last check: 2007-11-03)
		Importantly PROGOL was able to find a predictive relationship within a subset of compounds that was not previously identified by experts.
		This proposal extends stems from an earlier study using GOLEM to derive topological relationships governing the a/b class of proteins (King et al., 1994).
		Data mining was performed on a topological database of protein structures established by Dr Rawling's group at the ICRF (Rawlings et al., 1985; Clark et al., 1991).
	www.sbg.bio.ic.ac.uk /ilp/bbsrc/proposal/node6.html (138 words)

	Learning (Site not responding. Last check: 2007-11-03)
		One of the advantages of ILP algorithms is their much broader range of applicability.
		Examples of ILP systems using inverse resolution are GOLEM [Muggleton, 1992], which generated predictions of protein structure from sequence data; it was also used to predict the theraputic use of drugs based on their molecular structures [King, 1992].
		The other approach to ILP is essentially a generalization of decision tree learning to first-order logic.
	www.cs.dartmouth.edu /~brd/Teaching/AI/Lectures/Summaries/learning.html (9712 words)

	Realizing Progol by Forward Reasoning
		Recently many ILP systems, such as Progol[6], FOIL[8] and Golem[5], have been developed and used for many nontrivial applications with significant results.
		ILP system explores the hypothesis space to induce hypotheses.
		Progol is one of the typical ILP systems using refinement operator.
	bruch.sfc.keio.ac.jp /Ilp/paper/ilp97o/ilp97o.html (2336 words)

	General Intelligence (Site not responding. Last check: 2007-11-03)
		Inductive logic programming seems to be the harder part of our project (in fact ILP is considered one of the hardest areas in computer science!)
		Peter A Flach's website: www.cs.bris.ac.uk/~flach and his PowerPoint on Knowledge Representation and ILP.
		We are currently looking for researchers in ILP to collaborate with us to develop the Inductive Learner...
	www.geocities.com /GenericAI/InductiveLearning.htm (826 words)

	The Encyclopedia of Computer Languages (Site not responding. Last check: 2007-11-03)
		The principal advantages are that it allows the user to customise: (a) the search strategy; (b) the evaluation function; and (c) the refinement operator.
		Immediately the golem began to rise.andquot; From The Golem by Isaac Bashevis Singer with illustrations by Uri Shulevitz.
		A good introduction to the theory, implementation and applications of ILP can be found in S.H. Muggleton and L. De Raedt (1994), Inductive Logic Programming: Theory and Methods, Jnl.
	hopl.murdoch.edu.au /showlanguage2.prx?exp=5491 (357 words)

	Citebase - Induction of First-Order Decision Lists: Results on Learning the Past Tense of English Verbs
		Due to the expressiveness of first-order logic, ILP methods can learn relational and recursive concepts that cannot be represented in the attribute/value representations assumed by most machine-learning algorithms.
		The development of Foidl was motivated by a failure we observed when applying existing ILP methods to a particular problem, that of learning the past tense of English verbs.
		Although ILP methods seem more appropriate for this problem, our initial attempts to apply Foil and Golem to past-tense learning gave very disappointing results (Califf, 1994).
	www.citebase.org /cgi-bin/citations?id=oai:arXiv.org:cs/9506102 (6522 words)

	The Aleph Manual (Site not responding. Last check: 2007-11-03)
		Early ILP work (in the Claudien system) demonstrated the value of discovering all non-Horn constraints that hold in a database.
		Early ILP work (for example, in the Claudien system) demonstrated the value of discovering all non-Horn constraints that hold in a database.
		There is, in fact, nothing within the ILP framework that requires this to be the case.
	web.comlab.ox.ac.uk /oucl/research/areas/machlearn/Aleph/aleph.html (13021 words)

	Inductive Logic Programming - Theory
		This page provides an outline of the fundamental concepts and theory of ILP.
		Both Logic Programming and ILP are built upon Robinson's seminal work on Resolution Theorem Proving.
		He demonstrated that deductive inference in the first order predicate calculus could be effected by the single Resolution rule of inference.
	www.cs.york.ac.uk /mlg/ilp_theory.html (2111 words)

	ILP Systems Descriptions
		A list of ILP systems was initially set up by ILPnet.
		Some ILP systems are accessible through the MLnet ML-Archive Software list.
		Send us descriptions of and/or pointers to the home pages of your ILP systems (send an e-mail to: ilpnet2@ijs.si).
	www-ai.ijs.si /~ilpnet2/systems (117 words)

	The CHILLIN Inductive Logic Programming System (Site not responding. Last check: 2007-11-03)
		CHILLIN is an ILP system which integrates top-down search (a la FOIL), bottom-up search (a la GOLEM) and predicate invention (a la CHAMP).
		In particular, it combines a bottom-up method similar to GOLEM with a top-down method similar to FOIL.
		Systematic experimental comparisons to both GOLEM and FOIL on a range of problems are used to clearly demonstrate the advantages of the approach.
	www.cs.utexas.edu /~ml/chillin.html (202 words)

	Omniseek: /Science & Tech /Computer Science /Logic Programming
		The Group's research is mainly though not entirely, devoted to Inductive Logic Programming: a form of machine learning in which the learning program...
		Inductive logic programming (ILP) is a research area lying at the intersection of inductive...
		Inductive logic programming (ILP) is the intersection of inductive learning and logic programming...
	www.omniseek.com /search/search.html?%%bW9kZT1PbW5pc2VlayZ0aWQ9NzUxNzAmY250PTI1JmJnbj03NQ== (434 words)

Try your search on: Qwika (all wikis)