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 30
Página 149
... pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent that is likely to lead to the goal of producing the empty clause ( shown ...
... pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent that is likely to lead to the goal of producing the empty clause ( shown ...
Página 154
... pair of complementary literals , only one pair should be omitted from the resolvent . ( c ) If the resolvent is the empty clause , then a contradiction has been found . If it is not , then add it to the set of clauses available to the ...
... pair of complementary literals , only one pair should be omitted from the resolvent . ( c ) If the resolvent is the empty clause , then a contradiction has been found . If it is not , then add it to the set of clauses available to the ...
Página 504
... pair requires two stages : a forward pass and a backward pass . The forward pass involves presenting a sample input ... pair . After it has seen all the input - output pairs ( and adjusted its weights that many times ) , we say that one ...
... pair requires two stages : a forward pass and a backward pass . The forward pass involves presenting a sample input ... pair . After it has seen all the input - output pairs ( and adjusted its weights that many times ) , we say that one ...
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