Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 52
Página 3
... theorems . It was able to prove several theorems from the first chapter of Whitehead and Russell's Principia Mathematica . Gelernter's theorem prover explored another area of mathematics : geometry . Game playing and theorem proving ...
... theorems . It was able to prove several theorems from the first chapter of Whitehead and Russell's Principia Mathematica . Gelernter's theorem prover explored another area of mathematics : geometry . Game playing and theorem proving ...
Página 47
... theorem . We proceed by first proving a lemma that we think will be useful . Eventually , we realize that the lemma is no help at all . Are we in trouble ? No. Everything we need to know to prove the theorem is still true and in memory ...
... theorem . We proceed by first proving a lemma that we think will be useful . Eventually , we realize that the lemma is no help at all . Are we in trouble ? No. Everything we need to know to prove the theorem is still true and in memory ...
Página 165
... theorems , many of the ideas in it can be applied to a variety of domains in which it is necessary to deduce new statements from known ones . For another discussion of theorem proving using natural mechanisms , see Boyer and Moore ...
... theorems , many of the ideas in it can be applied to a variety of domains in which it is necessary to deduce new statements from known ones . For another discussion of theorem proving using natural mechanisms , see Boyer and Moore ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space