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 45
Página 198
... nonmonotonic inference . ' Allowing such reasoning has a significant impact on a knowledge base . Non- monotonic ... nonmonotonic reasoning does not share this property , it is also called defeasible : a nonmonotonic inference may be ...
... nonmonotonic inference . ' Allowing such reasoning has a significant impact on a knowledge base . Non- monotonic ... nonmonotonic reasoning does not share this property , it is also called defeasible : a nonmonotonic inference may be ...
Página 200
... nonmonotonic reasoning works in all of them . The box labeled A corresponds to an original set of wff's . The large circle contains all the models of A. When we add some nonmonotonic reasoning capabilities to A , we get a new set of ...
... nonmonotonic reasoning works in all of them . The box labeled A corresponds to an original set of wff's . The large circle contains all the models of A. When we add some nonmonotonic reasoning capabilities to A , we get a new set of ...
Página 201
... nonmonotonic reasoning that can be defined in those logics : • Abduction • Inheritance Nonmonotonic Logic One system that provides a basis for default reasoning is Nonmonotonic Logic ( NML ) [ McDermott and Doyle , 1980 ] , in which the ...
... nonmonotonic reasoning that can be defined in those logics : • Abduction • Inheritance Nonmonotonic Logic One system that provides a basis for default reasoning is Nonmonotonic Logic ( NML ) [ McDermott and Doyle , 1980 ] , in which the ...
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