Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 45
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 ...
Página 298
... inference are strictly syntactic procedures that operate on well - formed formulas ( wff ) regardless of what those formulas represent . Production rule systems are primarily syntactic also . The interpreters for these systems usually ...
... inference are strictly syntactic procedures that operate on well - formed formulas ( wff ) regardless of what those formulas represent . Production rule systems are primarily syntactic also . The interpreters for these systems usually ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's