Shapiro, A. and Niblett, T. (1982). Automatic induction of classification rules for a chess end-game. In M. Clarke (Ed.), Advances in Computer Chess 3 (pp. 73-92). Oxford: Pergamon. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
The Current and Future Role of Chess in Artificial.. - Levinson, al. (1990) (Correct)
Towards Domain-Independent Machine Intelligence - Levinson (1993) (1 citation) (Correct)
Experience-Based Adaptive Search - Gould, Levinson (1992) (3 citations) (Correct)
How Hard is the Correct Coding of An Easy Endgame - Jean-Christophe Weill.. (1994) (Correct)
Experience-Based Creativity - Levinson (1991) (1 citation) (Correct)
Knowledge Discovery in Chess Databases: A Research Proposal - Fürnkranz (Correct)
Knowledge Discovery in Chess Databases: A Research Proposal - Fürnkranz (Correct)
Wrappers For Performance Enhancement And Oblivious Decision Graphs - Kohavi (1995) (43 citations) (Correct)
Representing Arguments as Background Knowledge for Constraining .. - Peter Clark (1988) (2 citations) (Correct)
Learning Logical Exceptions In Chess - Bain (1994) (7 citations) (Correct)
Method Integration for Experience-Based Learning - Gould, Levinson (1991) (Correct)
Learning Mechanisms which Construct - Neighbourhood Representations Chris (Correct)
Induction in Noisy Domains - Clark, Niblett (1987) (21 citations) Self-citation (Niblett) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC