Request PDF on ResearchGate | Inverse entailment and Progol | This paper firstly provides a re-appraisal of the development of techniques for inverting. Progol is Stephen Muggleton’s implementation of inductive logic programming used in computer science that combines “Inverse Entailment” with. Progol is implemented in C and available by anonymous ftp. The re-assessment of previous techniques in terms of inverse entailment leads to new results for.

Author: Durr Mazukree
Country: Russian Federation
Language: English (Spanish)
Genre: Education
Published (Last): 23 July 2015
Pages: 175
PDF File Size: 4.13 Mb
ePub File Size: 20.70 Mb
ISBN: 516-2-27704-780-3
Downloads: 2363
Price: Free* [*Free Regsitration Required]
Uploader: Mikajin

Progol is implemented in C and available by anonymous ftp. Retrieved from ” https: Topics Discussed in This Paper. Ross Quinlan ‘s FOIL Progol’s search is efficient and has a provable guarantee of returning a solution having the maximum “compression” in the search-space. Progol allows arbitrary Prolog programs as background knowledge and arbitrary definite clauses as examples.

CiteSeerX — Inverse entailment and Progol

Language identi cation in the limit. From This Paper Figures, tables, and topics from this paper.


This artificial intelligence -related article is a stub. Progol deals with noisy data by using the “compression measure” to trade-off the description of errors against the hypothesis description length. This paper has highly influenced other papers.

Inverse entailment and progol

You can help Wikipedia by expanding it. Skip to search form Skip to main content. This clause is used to guide a refinement-graph search. Views Read Edit View history.

Progol is Stephen Muggleton ‘s implementation of inductive logic programming used in computer science that combines “Inverse Entailment” with “general-to-specific search” through a refinement graph. The Principles of Science: By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.

References Publications referenced by this paper. The ef- fect of background knowledge in inductive logic programming: Probabilistic Theory Revision from Examples: Use dmy dates from September All stub articles. Showing of 57 references. Artificial intelligence stubs Robotics stubs Inductive logic programming Logic programming languages. Are grammatical representations useful forlearning from biological sequence data?


This page was last edited on 24 Septemberat Ross Quinlan Machine Learning Extensions of inversion of resolution applied to theory com- pletion. Muggleton, editor, Inductive Logic Programming….

From Wikipedia, the free encyclopedia. A learnability model for universal representa- tions. Languages Deutsch Edit links. By using this site, you agree inverxe the Terms of Use and Privacy Policy.

This robotics-related article is a stub. Citations Publications citing this paper.

Inverse entailment and progol – Semantic Scholar

Learning logical definitions from relations J. Showing of extracted citations. The mathematical theory of communication.