Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 44
Página 198
... inference that depends on the lack of some piece of knowledge a nonmonotonic inference . ' Allowing such reasoning has a significant impact on a knowledge base . Non- monotonic reasoning systems derive their name from the fact that ...
... inference that depends on the lack of some piece of knowledge a nonmonotonic inference . ' Allowing such reasoning has a significant impact on a knowledge base . Non- monotonic reasoning systems derive their name from the fact that ...
Página 291
... inference is very efficient , while general logical reasoning is computation- ally hard . CYC actually supports about twenty types of efficient inference mechanisms ( including inheritance and transfers - through ) , each with its own ...
... inference is very efficient , while general logical reasoning is computation- ally hard . CYC actually supports about twenty types of efficient inference mechanisms ( including inheritance and transfers - through ) , each with its own ...
Página 292
... inference mechanisms used by CYC are stored explicitly as EL templates in the knowledge base . These templates can be modified like any other frames , and a user can create a new inference template by copying and editing an old one ...
... inference mechanisms used by CYC are stored explicitly as EL templates in the knowledge base . These templates can be modified like any other frames , and a user can create a new inference template by copying and editing an old one ...
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