Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 43
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
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