Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 41
Página 172
... assertions as code is not a very radical idea , given that all programs are really data to other programs that ... assertions are examined during the search for a response . If we view the assertions as declarative , then they do not ...
... assertions as code is not a very radical idea , given that all programs are really data to other programs that ... assertions are examined during the search for a response . If we view the assertions as declarative , then they do not ...
Página 215
... assertion Suspect Abbott has an associated TMS justification . Each justification consists of two parts : an IN - list and an OUT - list . In the figure , the assertions on the IN - list are connected to the justification by " + " links ...
... assertion Suspect Abbott has an associated TMS justification . Each justification consists of two parts : an IN - list and an OUT - list . In the figure , the assertions on the IN - list are connected to the justification by " + " links ...
Página 300
... assertions , such as " Every person with three children owns a car . ” The atomic predicates used in ABox assertions refer to concepts defined in the TBox . In logic - based systems , predicates such as triangle and polygon are ...
... assertions , such as " Every person with three children owns a car . ” The atomic predicates used in ABox assertions refer to concepts defined in the TBox . In logic - based systems , predicates such as triangle and polygon 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