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 85
Página 206
... Single and create the following knowledge base : Single ( John ) Single ( Mary ) Then , if we ask about Jane , the CWA will yield the answer ¬Single ( Jane ) . But now suppose we had chosen instead to use the predicate Married rather than ...
... Single and create the following knowledge base : Single ( John ) Single ( Mary ) Then , if we ask about Jane , the CWA will yield the answer ¬Single ( Jane ) . But now suppose we had chosen instead to use the predicate Married rather than ...
Página 434
... single person . It is very difficult to get many diverse people to build a single , coherent knowledge base , and sometimes it is impossible because their models of the domain are actually inconsistent . 6. Distributed Problems - Some ...
... single person . It is very difficult to get many diverse people to build a single , coherent knowledge base , and sometimes it is impossible because their models of the domain are actually inconsistent . 6. Distributed Problems - Some ...
Página 445
... single agent must be consistent and the labels that are attached to nodes that have been explicitly shared among ... single human brain functions . The book , The Society of Mind [ Minsky , 1985 ] explores the notion that single minds ...
... single agent must be consistent and the labels that are attached to nodes that have been explicitly shared among ... single human brain functions . The book , The Society of Mind [ Minsky , 1985 ] explores the notion that single minds ...
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