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 11
Página 69
... Output of the Match The result of the matching process is a list of rules whose left sides have matched the current state description , along with whatever variable bindings were generated by the matching process . It is the job of the ...
... Output of the Match The result of the matching process is a list of rules whose left sides have matched the current state description , along with whatever variable bindings were generated by the matching process . It is the job of the ...
Página 307
... output templates . In these output templates , numbers ( such as 4 ) indicate that whatever was matched by the corresponding segment ( e.g. , the fourth ) of the input template should be inserted at the indicated place in the response ...
... output templates . In these output templates , numbers ( such as 4 ) indicate that whatever was matched by the corresponding segment ( e.g. , the fourth ) of the input template should be inserted at the indicated place in the response ...
Página 325
... output structure always mirrors the structure of the grammar rules that created it , ATNs allow output structures of arbitrary form . For an example of their use , see [ Simmons , 1973 ] , which describes a system that uses an ATN ...
... output structure always mirrors the structure of the grammar rules that created it , ATNs allow output structures of arbitrary form . For an example of their use , see [ Simmons , 1973 ] , which describes a system that uses an ATN ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraint contains database described discussed domain example expert systems exploit explore fact frame game tree given grammar graph heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP Marcus match minimax move MTRANS MYCIN node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production systems PROLOG propositional logic question reasoning representing knowledge resolution rules satisfied script search procedure search process Section semantic net semantic nets sentence shown in Figure simple situation slots solution solve specific statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding UNSTACK variable variety vertex