Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 79
Página 117
... called backward rules . Such rules have also been called if - needed rules . • Rules that describe actions that should be taken if a value ever becomes known . These rules are called forward rules , or sometimes if - added rules . We ...
... called backward rules . Such rules have also been called if - needed rules . • Rules that describe actions that should be taken if a value ever becomes known . These rules are called forward rules , or sometimes if - added rules . We ...
Página 386
... called a grammar , of the syntactic facts about the language • A procedure , called a parser , that compares the grammar against input sentences to produce parsed structures 15.2.1 Grammars and Parsers The most common way to represent ...
... called a grammar , of the syntactic facts about the language • A procedure , called a parser , that compares the grammar against input sentences to produce parsed structures 15.2.1 Grammars and Parsers The most common way to represent ...
Página 532
... called qualitative simulation [ Kuipers , 1986 ] . The idea is to construct a sequence of discrete " episodes " that occur as qualitative variables change values . States are linked to other states by qualitative rules . Some rules are ...
... called qualitative simulation [ Kuipers , 1986 ] . The idea is to construct a sequence of discrete " episodes " that occur as qualitative variables change values . States are linked to other states by qualitative rules . Some rules are ...
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