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 3
Página 94
... list possible values for a single object . The second kind are more complex ... example they were treated identically . For some problems , however , it may be ... subgoals are set up to establish the preconditions of the operators is ...
... list possible values for a single object . The second kind are more complex ... example they were treated identically . For some problems , however , it may be ... subgoals are set up to establish the preconditions of the operators is ...
Página 142
... list of conditions remaining to be proved is empty and so the proof has succeeded . Notice in those proofs that whenever a statement of the form : аль → с was used , a and b were set up as independent subgoals . In one sense they are ...
... list of conditions remaining to be proved is empty and so the proof has succeeded . Notice in those proofs that whenever a statement of the form : аль → с was used , a and b were set up as independent subgoals . In one sense they are ...
Página 341
... order to apply STACK ( C , A ) , its preconditions must hold , so we must establish them as subgoals . Again we must ... list itself by stating the predicates in the order in which they should be achieved . Next we check to see if CLEAR ...
... order to apply STACK ( C , A ) , its preconditions must hold , so we must establish them as subgoals . Again we must ... list itself by stating the predicates in the order in which they should be achieved . Next we check to see if CLEAR ...
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