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 54
Página 139
... further problem arises when information is incomplete and it is not possible to prove that no exceptions apply in a particular instance . But we defer consideration of this problem until Chapter 7 . 5.3 Computable Functions and ...
... further problem arises when information is incomplete and it is not possible to prove that no exceptions apply in a particular instance . But we defer consideration of this problem until Chapter 7 . 5.3 Computable Functions and ...
Página 140
... further reasoning , we can simply invoke a procedure , which we will specify in addition to our regular rules , that will evaluate it and return true or false . It is often also useful to have computable functions as well as computable ...
... further reasoning , we can simply invoke a procedure , which we will specify in addition to our regular rules , that will evaluate it and return true or false . It is often also useful to have computable functions as well as computable ...
Página 196
... further beliefs were accorded a subordinate status as underlying evidence : a belief about a hotel register , a ... further , seeking evidence in turn for them . In practice , the probing stops when we are satisfied how best to restore ...
... further beliefs were accorded a subordinate status as underlying evidence : a belief about a hotel register , a ... further , seeking evidence in turn for them . In practice , the probing stops when we are satisfied how best to restore ...
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