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 76
Página 340
... goal stack is simply ON ( C , A ) ^ ON ( B , D ) ^ ONTABLE ( A ) ^ ONTABLE ( D ) But we want to separate this problem into four subproblems , one for each component of the original goal . Two of the subproblems , ONTABLE ( A ) and ...
... goal stack is simply ON ( C , A ) ^ ON ( B , D ) ^ ONTABLE ( A ) ^ ONTABLE ( D ) But we want to separate this problem into four subproblems , one for each component of the original goal . Two of the subproblems , ONTABLE ( A ) and ...
Página 342
... goal stack , ON ( B , A ) , to the world model , we see that it is satisfied . So we pop it off and consider the next goal , CLEAR ( B ) . It , too , is already true in the world model , although it was not stated explicitly as one of ...
... goal stack , ON ( B , A ) , to the world model , we see that it is satisfied . So we pop it off and consider the next goal , CLEAR ( B ) . It , too , is already true in the world model , although it was not stated explicitly as one of ...
Página 347
... goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a time , in order . A plan generated by this method contains a sequence of operators for attaining the first goal , followed by a ...
... goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a time , in order . A plan generated by this method contains a sequence of operators for attaining the first goal , followed by a ...
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