Artificial Intelligence, Volumen1McGraw-Hill, 1983 - 436 páginas What is artificial intelligence?; Problem solving; Problems and problem spaces; Basic problem-solving methods; Game playing; Knowledge representation; Knowledge representation using predicate logic; Knowledge representation using other logics; Structured representation of knowledge; Advanced topics; Advanced problem-solving systems; Natural language understanding; Perception; Learning; Implementing A.lI. systems: languages and machines; Conclusion; References; Index. |
Dentro del libro
Resultados 1-3 de 86
Página 116
... described in Chapter 3 can be used . It can be ap- plied to reason forward from the current state as far as possible in the time al- lowed . The heuristic function h ' can be applied at terminal nodes and used to propagate values back ...
... described in Chapter 3 can be used . It can be ap- plied to reason forward from the current state as far as possible in the time al- lowed . The heuristic function h ' can be applied at terminal nodes and used to propagate values back ...
Página 131
... described in [ Stanier , 1975 ] . A program to locate missing honors is described in [ Quinlan , 1979 ] . 4.8 EXERCISES 1. Consider the following game tree : E B G H A с K L M N O P Q R S T U V W X Y 7 6 8 5 2 3 0 -2 6 2 5 8 9 2 Suppose ...
... described in [ Stanier , 1975 ] . A program to locate missing honors is described in [ Quinlan , 1979 ] . 4.8 EXERCISES 1. Consider the following game tree : E B G H A с K L M N O P Q R S T U V W X Y 7 6 8 5 2 3 0 -2 6 2 5 8 9 2 Suppose ...
Página 267
... described in the last section , problems in- volving conjoined goals were solved by first solving one of the goals , then another , and so forth , until all of the original ones had been achieved . All the plans that are generated by ...
... described in the last section , problems in- volving conjoined goals were solved by first solving one of the goals , then another , and so forth , until all of the original ones had been achieved . All the plans that are generated by ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY Artificial Intelligence backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraints contains database described discussed domain example exploit explore fact frame game tree goal grammar graph heuristic heuristic function important input INTERLISP ISA links John knowledge representation labelings LISP Marcus match methods minimax move MYCIN natural language necessary node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production system PROLOG propositional logic question reasoning representing knowledge rules Schank script search procedure search process Section semantic net sentence shown in Figure simple situation slots solution solve specific stack statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding variety