An algorithm for incremental mode induction

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3029, Issue , 2004, Pages 512-522

  Di Mauro, Nicola ^a   Esposito, Floriana ^a   Ferilli, Stefano ^a   Basile, Teresa M A ^a  

^a UNIVERSITY OF BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS; LOGIC PROGRAMMING; PROBLEM SOLVING; SEMANTICS; EXPERT SYSTEMS;

DESCRIPTION LANGUAGES; INDUCTIVE LOGIC PROGRAMMING (ILP); INTELLIGENT SYSTEMS; META KNOWLEDGE; KNOWLEDGE ACQUISITION BOTTLENECKS; LEARNING PROCESS; META-KNOWLEDGE; SEARCH PROBLEM; SPEED UP;

KNOWLEDGE ACQUISITION; INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 9444222034     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24677-0_53     Document Type: Conference Paper

References (17)

1. Eric McCreath and Arun Sharma. Extraction of Meta-Knowledge to Restrict the Hypothes Space for ILP Systems. Eight Australian Joint Conference on Artificial Intelligence,pp.75-82, Xin Yao, 1995
2. D.H.D. Warren. Implementing Prolog - Compiling Predicate Logic Programs. Research Reports 39 and 40, Dept. of Artificial Intelligence, University of Edinburgh, 1977.
3. C.S. Mellish. The Automatic Generation of Mode Declarations for Prolog Programs. DAI Research Paper 163, Dept. of Artificial Intelligence, University of Edinburgh, Aug. 1981.
4. C.S. Mellish. Some Global Optimizations for a Prolog Compiler. J. Logic Programming 2, 1 (Apr. 1985), pp.43-66.
5. U.S. Reddy. Transformation of Logic Programs into Functional Programs, In Proc. 1984 Int.Symposium on Logic Programming, IEEE Computer Society, Atlantic City, New Jersey, Feb. 1984, pp.187-196.
6. M. Bruynooghe, B. Demoen, A. Callebaut and G. Janssens. Abstract Interpretation: To-wards the Global Optimization of Prolog Programs. In Proc. Fourth IEEE Symposium on Logic Programming, San Francisco, CA, Sep. 1987.
7. H. Manilla and E. Ukkonen. Flow Analysis of Prolog Programs. In Proc. Fourth IEEE Symposium on Logic Programming, San Francisco, CA, Sep. 1987.
8. S.K. Debray and D.S. Warren. Automatic Mode Inference for Logic Programs. Journal of Logic Programming, vol.5, n.3, pp.207-229, 1988.
9. K. Morik, S. Wrobel, J. Kietz, and W. Emde. Knowledge Acquisition and Machine Learning: Theory Methods and Applications. Academic Press, 1993.
10. S. Muggleton and C. Feng. Efficient Induction of Logic Programs. In Proceedings of the First Conference on Algorithmic Learning Theory, Tokyo, pp.368-381. Ohmsa Publishers, 1990.
11. R.M. Cameron-Jones and J.R. Quinlan. Efficient top-down induction of logic programs. SIGART Bulletin, 5(1):33-42, 1994.
12. S. Muggleton, Inverse Entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming, 13 (3-4), Ohmsha, pp.245-286, 1995.
13. M. Furusawa, N. Inuzuka, H. Seki and H. Itoh. Bottom-up induction of logic programs with more than one recursive clause. In Proceedings of IJCAI97 workshop Frontiers of ILP,Nagoya, 1997.
14. P. Idestam-Almquist. Efficient induction of recursive definitions by structural analysis of saturations. In L. De Raedt (Ed.), Advances in Inductive Logic Programming, pp.192-205. IOS Press, 1996.
15. E. McCreath and A. Sharma. LIME: A System for Learning Relations. Algorithmic Learning Theory, pp.336-374, 1998.
16. C. Rouveirol. Extensions of Inversion of Resolution Applied to Theory Completion. Inductive Logic Programming, pp.64-90, S. Muggleton, Academic Press, 1992.
17. F. Esposito, S. Ferilli, N. Fanizzi, T.M.A. Basile and N. Di Mauro. Incremental Multistrategy Learning for Document Processing. Applied Artificial Intelligence Journal, 17:859-883, Taylor & Francis, London, 2003.