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: | Kajikasa Kazibei |

Country: | Cape Verde |

Language: | English (Spanish) |

Genre: | Video |

Published (Last): | 6 January 2005 |

Pages: | 461 |

PDF File Size: | 20.46 Mb |

ePub File Size: | 6.38 Mb |

ISBN: | 235-1-89444-300-8 |

Downloads: | 62591 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Taugul |

By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. Are grammatical representations useful forlearning from biological sequence data? Citations Publications citing this paper. Probabilistic Theory Revision from Examples: The ef- fect of background knowledge in inductive logic programming: This page was last edited on 24 Septemberat Languages Deutsch Edit links. Retrieved from ” https: Showing of 57 references.

A learnability model for universal representa- tions. Topics Discussed in This Paper.

### Inverse entailment and progol – Semantic Scholar

Showing of extracted citations. From This Paper Figures, tables, and topics from this paper.

The Principles of Science: The mathematical theory of communication. By using this site, you agree to the Terms of Entaioment and Privacy Policy. 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. You can help Wikipedia by expanding it.

## Inverse entailment and progol

Extensions of inversion of resolution applied to theory com- pletion. From Wikipedia, the free encyclopedia. This clause is used to guide a refinement-graph search. Ross Quinlan Machine Learning Progol deals with noisy data by using the “compression measure” to trade-off the description invfrse errors against the hypothesis description length.

Use dmy dates from September All stub articles. References Publications referenced by this paper. 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.

Skip to search form Skip to main content. This artificial intelligence -related article is a stub. Views Read Edit View history. Language identi cation in the limit. Learning logical definitions from relations J. Progol is implemented in C and available by anonymous ftp. Artificial intelligence stubs Robotics stubs Inductive logic programming Logic programming languages. Progol allows arbitrary Prolog programs as background knowledge and arbitrary definite clauses as examples.

### CiteSeerX â€” Inverse entailment and Progol

Muggleton, editor, Inductive Logic Programmingâ€¦. This robotics-related article is a stub.

This paper has highly influenced other papers.