Integrity constraints in ILP using a monte carlo approach

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

Volumn 1314, Issue , 1997, Pages 229-244

  Jorge, Alípio ^a   Brazdil, Pavel B ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; MONTE CARLO METHODS;

CONSTRAINT SATISFACTION; INDUCTIVE PROGRAM SYNTHESIS; INTEGRITY CONSTRAINTS; MONTE CARLO APPROACH; NEGATIVE EXAMPLES; OVERGENERALIZATION; RANDOM GENERATION; REALISTIC SCENARIO;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 84949213850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63494-0_58     Document Type: Conference Paper

References (20)

1. Aha, D. W., Lapointe, S., Ling, C. X., Matwin S (1994): Inverting Implication with Small Training Sets. Proceedings of the European Conference on Machine Learning, ECML- 94, ed. F. Bergadano and L. De Raedt, Springer Verlag.
2. Bergadano, F., Gunneti, D. and Trinchero, U. (1993): The Difficulties of Learning Logic Programs with Cut. Journal of Artificial Intelligence Research 1, 91-107, AI Access Foundation and Morgan Kaufmann Publishers.
3. Brazdil, P., Jorge, A. (1994): Learning by Refining Algorithm Sketches. Proceedings of ECAI-94, T. Cohn (ed.). Wiley.
4. De Raedt, L., Lavrac, N., Dzeroski, S. (1993): Multiple Predicate Learning. Proceedings of IJCAI-93. Morgan-Kaufmann.
5. De Raedt, L. (1992): Interactive Theory Revision:An Inductive Logic Programming Approach. Academic Press.
6. Devilie, Y., Lau, K.,(1994): Logic Program Synthesis. The Journal of Logic Programming, Ten Years of Logic Programming, volumes 19,20, May/July 1994.
7. Hogger, C. J. (1990): Essentials of Logic Programming. Graduate texts in computer science series, Oxford University Press.
8. Idestam-Almquist P (1996) Efficient Induction of Recursive Definitions by Efficient Analysis of Saturations. Advances in Inductive Logic Programming, Ed. by Luc De Raedt, IOS Press/Ohmsha.
9. Jorge, A. and Brazdil, P. (1996): Architecture for Iterative Learning of Recursive Definitions. Advances in Inductive Logic Programming, Ed. by Luc De Raedt, IOS Press/Ohmsha.
10. Lavrac, N. and Dzeroski, S. (1994): Inductive Logic Programming, Techniques and Applications. Ellis Horwood.
11. Manthey, R. and Bry, F. (1988): SATCHMO: a theorem prover implemented in Prolog. Proceedings of CADE 88 (9th Conference on Automated Deduction),Springer-Verlag.
12. Muggleton, S., De Raedt, L., (1994): Inductive Logic Programming. The Journal of Logic Programming. Ten Years of Logic Programming, volumes 19,20, May/July 1994.
13. Muggleton, S. (1995): Stochastic Logic Programs. Advances in Inductive Logic Programming, Ed. by Luc De Raedt, IOS Press/Ohmsha.
14. Muggleton, S. (1993): Inductive Logic Programming: derivations, successes and shortcomings. Proceedings of ECML- 93, Springer-Verlag.
15. Quinlan, J.R. (1990): Learning logical definitions from relations. Machine Learning 5, 239-266.
16. Quinlan, J.R. (1993): FOIL: A Midterm Report. Proceedings of ECML-93, Springer-Verlag.
17. Quinlan, J.R. (1996): Learning First-Order Definitions of Functions. Journal of Artificial Intelligence Research, to appear.
18. Sadri, F., Kowalski, R. (1988): A Theorem Proving Approach to Database Integrity in Deductive Databases and Logic Programming, ed. by Jack Minker, Morgan Kaufmann Publishers.
19. Shapiro, E. Y., (1982) Algorithmic Program Debugging, MIT Press, Cambridge MA.
20. Zelle J M, Mooney R J, Konvisser J B, (1994): Combining Top-down and Bottom-up Techniques in Inductive Logic Programming. Proceedings of the Eleventh International Conference on Machine Learning ML-94, Morgan-Kaufmann.