Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 25
Página 174
... PROLOG Figure 6.1 : A Declarative and a Procedural Representation which is a well - formed Horn clause . As we will see below , when Horn clauses are written in PROLOG programs , they actually look more like the form we started with ...
... PROLOG Figure 6.1 : A Declarative and a Procedural Representation which is a well - formed Horn clause . As we will see below , when Horn clauses are written in PROLOG programs , they actually look more like the form we started with ...
Página 175
... PROLOG , the same implication is written " backward , " as q : - p . This form is natural in PROLOG because the interpreter always works backwards from a goal , and this form causes every rule to begin with the component that must ...
... PROLOG , the same implication is written " backward , " as q : - p . This form is natural in PROLOG because the interpreter always works backwards from a goal , and this form causes every rule to begin with the component that must ...
Página 177
... PROLOG code that uses search strategies other than depth - first with backtracking , it is difficult to do so . It is even more difficult to apply domain knowledge to constrain a search . PROLOG does allow for rudimentary control of ...
... PROLOG code that uses search strategies other than depth - first with backtracking , it is difficult to do so . It is even more difficult to apply domain knowledge to constrain a search . PROLOG does allow for rudimentary control of ...
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