Theory completion using inverse entailment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1866, Issue , 2000, Pages 130-146

  Muggleton, Stephen H ^a   Bryant, Christopher H ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; PROLOG (PROGRAMMING LANGUAGE);

ABDUCTIVE INFERENCE; BACK-GROUND KNOWLEDGE; INVERSE ENTAILMENT; LANGUAGE LEARNING; METABOLIC PATHWAYS; PERFORMANCE TESTING; SCIENTIFIC DISCOVERY; THEOREM PROVERS;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 84954424598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44960-4_8     Document Type: Conference Paper

References (20)

1. H. Ade, L. De Raedt, and M. Bruynooghe. Theory revision. In S. Muggleton, editor, Proceedings of the 3rd International Workshop on Inductive Logic Programming, pages 179–192, 1993.
2. Y. Dimopoulos and A. Kakas. Abduction and inductive learning. In L. De Raedt, editor, Proceedings of the Fifth Inductive Logic Programming Workshop (ILP95), pages 25–28, Leuven, Belgium, 1995. KU Leuven.
3. B. Dujon. The yeast genome project-what did we learn? Trends in Genetics, 12:263–270, 1996.
4. K. Furukawa. On the completion of the most specific hypothesis computation in inverse entailment for mutual recursion. In Proceedings of Discovery Science’98, LNAI 1532, pages 315–325, Berlin, 1998. Springer-Verlag.
5. Goffeau, A. et multi al. Life with 6000 genes. Science, 274:546–567, 1996.
6. K. Ito and A. Yamamoto. Finding hypotheses from examples by computing the least generlisation of bottom clauses. In S. Arikawa and H. Motoda, editors, Proceedings of Discovery Science’98, pages 303–314. Springer, Berlin, 1998. LNAI 1532.
7. A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2, 1992.
8. S. Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245–286, 1995.
9. S. Muggleton. Completing inverse entailment. In C. D. Page, editor, Proceedings of the Eighth International Workshop on Inductive Logic Programming (ILP-98), LNAI 1446, pages 245–249. Springer-Verlag, Berlin, 1998.
10. S. G. Oliver. From DNA sequence to biological function. Nature, 379:597–600, 1996.
11. G. Plotkin. A further note on inductive generalization. In Machine Intelligence, volume 6. Edinburgh University Press, 1971.
12. L. De Raedt. Interactive Theory Revision: an Inductive Logic Programming Approach. Academic Press, 1992.
13. L. De Raedt and M. Bruynooghe. Interactive concept-learning and constructive induction by analogy. Machine Learning, 8:107–150, 1992.
14. L. De Raedt and N. Lavrac. Multiple predicate learning in two inductive logic programming settings. Journal on Pure and Applied Logic, 4(2):227–254, 1996.
15. B. L. Richards and R. J. Mooney. Automated refinement of first-order Horn-clause domain theories. Machine Learning, 19(2):95–131, 1995.
16. E. Y. Shapiro. Algorithmic program debugging. MIT Press, 1983.
17. M. Stickel. A Prolog technology theorem prover: implementation by an extended Prolog compiler. Journal of Automated Reasoning, 4(4):353–380, 1988.
18. J. Wogulis. Revising relational theories. In Proceedings of the 8th International Workshop on Machine Learning, pages 462–466. Morgan Kaufmann, 1991.
19. S. Wrobel. First-order theory refinement. In L. De Raedt, editor, Advances in Inductive Logic Programming, pages 14–33. IOS Press, Ohmsha, Amsterdam, 1995.
20. A. Yamamoto. Which hypotheses can be found with inverse entailment? In N. Lavrač and S. Džeroski, editors, Proceedings of the Seventh International Workshop on Inductive Logic Programming, pages 296–308. Springer-Verlag, Berlin, 1997. LNAI 1297.