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 90
Página 267
... Goal Set Using the goal - stack planning method 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 ...
... Goal Set Using the goal - stack planning method 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 ...
Página 269
... goal to work on next and an operator that might satisfy that goal , we computed the goal descrip- tion for the new node that was created by copying all of the nonselected goals from the parent node and adding the preconditions of the ...
... goal to work on next and an operator that might satisfy that goal , we computed the goal descrip- tion for the new node that was created by copying all of the nonselected goals from the parent node and adding the preconditions of the ...
Página 271
... goal ARMEMPTY . But when we regress ARMEMPTY through UNSTACK , we get False , because ARMEMPTY is in the DELETE list of UNSTACK . Since the goal False can never be attained , this branch can be pruned . The only operator that could be ...
... goal ARMEMPTY . But when we regress ARMEMPTY through UNSTACK , we get False , because ARMEMPTY is in the DELETE list of UNSTACK . Since the goal False can never be attained , this branch can be pruned . The only operator that could be ...
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