Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 56
Página 207
... knowledge base . We saw an example of this above when we considered the statement A ( Joe ) V B ( Joe ) . • It assumes that all predicates have all of their instances listed . Although in many database applications this is true , in ...
... knowledge base . We saw an example of this above when we considered the statement A ( Joe ) V B ( Joe ) . • It assumes that all predicates have all of their instances listed . Although in many database applications this is true , in ...
Página 444
... knowledge base and labeling the nodes in the knowledge base so that the labeling is consistent and well - founded . Both of these are global properties . But consider a distributed reasoning system in which there are several agents ...
... knowledge base and labeling the nodes in the knowledge base so that the labeling is consistent and well - founded . Both of these are global properties . But consider a distributed reasoning system in which there are several agents ...
Página 553
... base consistency • Ensuring knowledge base completeness The most useful knowledge acquisition programs are those that are restricted to a particular problem - solving paradigm , e.g. ... KNOWLEDGE ACQUISITION 553 Knowledge Acquisition.
... base consistency • Ensuring knowledge base completeness The most useful knowledge acquisition programs are those that are restricted to a particular problem - solving paradigm , e.g. ... KNOWLEDGE ACQUISITION 553 Knowledge Acquisition.
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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