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 84
Página 26
... rules can be written . For example , we could write a rule such as that shown in Figure 2-1 . However , if we write rules like the one above , we will have to write a very large number of them since there will have to be a separate rule ...
... rules can be written . For example , we could write a rule such as that shown in Figure 2-1 . However , if we write rules like the one above , we will have to write a very large number of them since there will have to be a separate rule ...
Página 66
... rules . All the rules that describe a given board position will be stored under the same key and so will be found together . Unfortunately , this simple indexing scheme only works because preconditions of rules match exact board ...
... rules . All the rules that describe a given board position will be stored under the same key and so will be found together . Unfortunately , this simple indexing scheme only works because preconditions of rules match exact board ...
Página 69
... rules had no left side , so the rule could apply anywhere . These rules were used if no other rules matched and they generated replies such as " Tell me more about that . " Notice that the rules themselves cause a form of approximate ...
... rules had no left side , so the rule could apply anywhere . These rules were used if no other rules matched and they generated replies such as " Tell me more about that . " Notice that the rules themselves cause a form of approximate ...
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