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: Meztilar Dujinn
Country: Madagascar
Language: English (Spanish)
Genre: History
Published (Last): 7 June 2007
Pages: 28
PDF File Size: 5.36 Mb
ePub File Size: 7.93 Mb
ISBN: 213-8-70565-961-6
Downloads: 45165
Price: Free* [*Free Regsitration Required]
Uploader: Marr

The ef- fect of background knowledge in inductive logic programming: Skip to search form Skip entailmeht main content. Retrieved from ” https: Use dmy dates from September All stub articles. Languages Deutsch Edit links. Progol deals with noisy data by using the “compression measure” to trade-off the description of errors against the hypothesis description length.

Inverse entailment and progol

The mathematical theory of communication. This page was last edited on 24 Septemberat Showing of extracted citations. This clause is used to guide a refinement-graph search. Progol is implemented in C and available by anonymous ftp. Are grammatical representations useful forlearning from biological sequence data?


Progol allows arbitrary Prolog programs as background knowledge and arbitrary definite clauses as examples. This paper has highly influenced other papers. Learning logical definitions from relations J.

References Publications referenced by this paper. Ross Quinlan Machine Learning This artificial intelligence -related article is a stub. You can help Wikipedia by expanding it. Topics Discussed in This Paper. Extensions of inversion of resolution applied to theory com- pletion. Showing of 57 references. By using this site, you agree to the Terms of Use and Privacy Policy. Views Read Edit View history. From Wikipedia, the free encyclopedia.

The Principles of Entailnent 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.

Inverse entailment and progol – Semantic Scholar

Citations Publications citing this paper. A learnability model for universal representa- tions. Artificial intelligence stubs Robotics stubs Inductive logic programming Logic programming languages.

This robotics-related article is a stub.


CiteSeerX — Inverse entailment and Progol

From This Paper Figures, tables, and topics from entailmrnt paper. Language identi cation in the limit. Probabilistic Theory Revision from Examples: Muggleton, editor, Inductive Logic Programming…. Progol is Stephen Muggleton ‘s implementation of inductive logic programming used in computer science that combines “Inverse Enfailment with “general-to-specific search” through a refinement graph.

By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.