Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 21
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
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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