Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 32
Página 154
... satisfy than their parents . To facilitate this , index clauses by the predicates they contain , combined with an indication of whether the predicate is negated . Then , given a particular clause , possible resolvents that contain a ...
... satisfy than their parents . To facilitate this , index clauses by the predicates they contain , combined with an indication of whether the predicate is negated . Then , given a particular clause , possible resolvents that contain a ...
Página 200
... satisfy B than A. The set of models corresponding to B is shown at the lower right of the large circle . Now suppose we add some new wff's ( representing new information ) to A. We represent A with these additions as the box C. A ...
... satisfy B than A. The set of models corresponding to B is shown at the lower right of the large circle . Now suppose we add some new wff's ( representing new information ) to A. We represent A with these additions as the box C. A ...
Página 340
... satisfies it is found , that sequence is applied to the state description , yielding a new description . Next , the goal that is then at the top of the stack is explored and an attempt is made to satisfy it , starting from the situation ...
... satisfies it is found , that sequence is applied to the state description , yielding a new description . Next , the goal that is then at the top of the stack is explored and an attempt is made to satisfy it , starting from the situation ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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