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 80
Página 168
... occur check ) . This should be possible since no two clauses will ever share variables . If x occurs in one , f ( x ) cannot occur in another . But suppose the unification procedure is given the following two clauses ( in the notation ...
... occur check ) . This should be possible since no two clauses will ever share variables . If x occurs in one , f ( x ) cannot occur in another . But suppose the unification procedure is given the following two clauses ( in the notation ...
Página 285
... occur . Conditions that will , in general , be true after the events described in the script have occurred . Slots representing objects that are involved in the events described in the script . The presence of these objects can be ...
... occur . Conditions that will , in general , be true after the events described in the script have occurred . Slots representing objects that are involved in the events described in the script . The presence of these objects can be ...
Página 533
... occurred sometime after the Franco - Prussian War . A commonsense theory of time must account for reasoning of this kind . The most basic notion of time is that it is occupied by events . These events occur during intervals , continuous ...
... occurred sometime after the Franco - Prussian War . A commonsense theory of time must account for reasoning of this kind . The most basic notion of time is that it is occupied by events . These events occur during intervals , continuous ...
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