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 35
Página 32
... side , and the resulting state is checked to see if it corresponds to a goal state . As long as it does not , the ... side of each rule describes a board configuration and is represented implicitly by the index position . The right side ...
... side , and the resulting state is checked to see if it corresponds to a goal state . As long as it does not , the ... side of each rule describes a board configuration and is represented implicitly by the index position . The right side ...
Página 60
... side of a river . They have agreed that they would all like to get to the other side . But the missionaries are not sure what else the cannibals have agreed to . So the missionaries want to manage the trip across the river in such a way ...
... side of a river . They have agreed that they would all like to get to the other side . But the missionaries are not sure what else the cannibals have agreed to . So the missionaries want to manage the trip across the river in such a way ...
Página 182
... sides and right sides contain pure assertions , then forward chaining can match assertions on the left side of a rule and add to the state description the assertions on the right side . But if arbitrary procedures are allowed as the right ...
... sides and right sides contain pure assertions , then forward chaining can match assertions on the left side of a rule and add to the state description the assertions on the right side . But if arbitrary procedures are allowed as the right ...
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