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 83
Página 123
... determine whether a particular object is a member of the set or not . There are two ways to state a definition of a set and its elements . The first is to list the members . Such a specification is called an extensional definition . The ...
... determine whether a particular object is a member of the set or not . There are two ways to state a definition of a set and its elements . The first is to list the members . Such a specification is called an extensional definition . The ...
Página 180
... determining the cause of a patient's illness . To do that , it uses rules that tell it such things as " If the organism has ... determine whether organism x is present . " ( For a discussion of the explanation capabilities of MYCIN , see ...
... determining the cause of a patient's illness . To do that , it uses rules that tell it such things as " If the organism has ... determine whether organism x is present . " ( For a discussion of the explanation capabilities of MYCIN , see ...
Página 368
... determine what the constraints are . 2. Solve the problem by applying a constraint satisfaction algorithm that effectively uses the constraints from step 1 to control the search . Recall that we presented such an algorithm in Section ...
... determine what the constraints are . 2. Solve the problem by applying a constraint satisfaction algorithm that effectively uses the constraints from step 1 to control the search . Recall that we presented such an algorithm in Section ...
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