Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 55
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
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's