Switch to: References

Add citations

You must login to add citations.
  1. Eurisko: A program that learns new heuristics and domain concepts.Douglas B. Lenat - 1983 - Artificial Intelligence 21 (1-2):61-98.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • A computational approach to George Boole's discovery of mathematical logic.Luis de Ledesma, Aurora Pérez, Daniel Borrajo & Luis M. Laita - 1997 - Artificial Intelligence 91 (2):281-307.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • MizarMode—an integrated proof assistance tool for the Mizar way of formalizing mathematics.Josef Urban - 2006 - Journal of Applied Logic 4 (4):414-427.
    Download  
     
    Export citation  
     
    Bookmark  
  • Why am and eurisko appear to work.Douglas B. Lenat & John Seely Brown - 1984 - Artificial Intelligence 23 (3):269-294.
    Download  
     
    Export citation  
     
    Bookmark   74 citations  
  • Logic and artificial intelligence.Nils J. Nilsson - 1991 - Artificial Intelligence 47 (1-3):31-56.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Learning structures of visual patterns from single instances.Yoshinori Suganuma - 1991 - Artificial Intelligence 50 (1):1-36.
    Download  
     
    Export citation  
     
    Bookmark  
  • Machine discovery.Herbert Simon - 1995 - Foundations of Science 1 (2):171-200.
    Human and machine discovery are gradual problem-solving processes of searching large problem spaces for incompletely defined goal objects. Research on problem solving has usually focused on search of an instance space (empirical exploration) and a hypothesis space (generation of theories). In scientific discovery, search must often extend to other spaces as well: spaces of possible problems, of new or improved scientific instruments, of new problem representations, of new concepts, and others. This paper focuses especially on the processes for finding new (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Theory formation by heuristic search.Douglas B. Lenat - 1983 - Artificial Intelligence 21 (1-2):31-59.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics.Dominique Pastre - 1989 - Artificial Intelligence 38 (3):257-318.
    Download  
     
    Export citation  
     
    Bookmark  
  • Reductionism and its heuristics: Making methodological reductionism honest.William C. Wimsatt - 2006 - Synthese 151 (3):445-475.
    Methodological reductionists practice ‘wannabe reductionism’. They claim that one should pursue reductionism, but never propose how. I integrate two strains in prior work to do so. Three kinds of activities are pursued as “reductionist”. “Successional reduction” and inter-level mechanistic explanation are legitimate and powerful strategies. Eliminativism is generally ill-conceived. Specific problem-solving heuristics for constructing inter-level mechanistic explanations show why and when they can provide powerful and fruitful tools and insights, but sometimes lead to erroneous results. I show how traditional metaphysical (...)
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited.C. E. Larson & N. Van Cleemput - 2016 - Artificial Intelligence 231:17-38.
    Download  
     
    Export citation  
     
    Bookmark  
  • Discovering patterns in sequences of events.Thomas G. Dietterich & Ryszard S. Michalski - 1985 - Artificial Intelligence 25 (2):187-232.
    Download  
     
    Export citation  
     
    Bookmark  
  • Acquiring Creative Knowledge for Knowledge-Based Systems.Z. Chen - 1996 - Journal of Intelligent Systems 6 (3-4):179-198.
    Download  
     
    Export citation  
     
    Bookmark