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 42
Página 148
... clauses , called the parent clauses , are compared ( resolved ) , yielding a new clause that has been inferred from them . The new clause represents ways that the two parent clauses interact with each other . Suppose that there are two ...
... clauses , called the parent clauses , are compared ( resolved ) , yielding a new clause that has been inferred from them . The new clause represents ways that the two parent clauses interact with each other . Suppose that there are two ...
Página 149
... clause form . Add it to the set of clauses obtained in step 1 . 3. Repeat until either a contradiction is found or no progress can be made : ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them together . The ...
... clause form . Add it to the set of clauses obtained in step 1 . 3. Repeat until either a contradiction is found or no progress can be made : ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them together . The ...
Página 154
... clauses obtained in 1 . 3. Repeat until either a contradiction is found , no progress can be made , or a prede- termined amount of effort has been expended . ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them ...
... clauses obtained in 1 . 3. Repeat until either a contradiction is found , no progress can be made , or a prede- termined amount of effort has been expended . ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them ...
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