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 33
Página 215
... Justification an alibi , then we should erase from the database the belief that Abbott is a suspect . But suppose ... justification . Each justification consists of two parts : an IN - list and an OUT - list . In the figure , the ...
... Justification an alibi , then we should erase from the database the belief that Abbott is a suspect . But suppose ... justification . Each justification consists of two parts : an IN - list and an OUT - list . In the figure , the ...
Página 216
... Justification structure are met . The first criterion is consistency : every node labeled IN is supported by at least one valid justification and all other nodes are labeled OUT . More specifically than before , a justification is valid ...
... Justification structure are met . The first criterion is consistency : every node labeled IN is supported by at least one valid justification and all other nodes are labeled OUT . More specifically than before , a justification is valid ...
Página 217
... justification and is labeled OUT . That Abbott was on the register of a far away hotel and the lack of belief that the register was forged will cause the appropriate forward rule to fire and create a justification for Alibi Abbott ...
... justification and is labeled OUT . That Abbott was on the register of a far away hotel and the lack of belief that the register was forged will cause the appropriate forward rule to fire and create a justification for Alibi Abbott ...
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