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 22
Página 310
... parse tree of a sentence reflects the productions that were applied to generate it . Top - Down versus Bottom - Up Parsing To parse a sentence , it is necessary to find a way in which that sentence could have been generated from the ...
... parse tree of a sentence reflects the productions that were applied to generate it . Top - Down versus Bottom - Up Parsing To parse a sentence , it is necessary to find a way in which that sentence could have been generated from the ...
Página 314
... parsing context - free languages is so much more efficient than parsing less restricted languages , we might want to go ahead and pretend English is contexi- free even if it means finding a number of parses that are not really ...
... parsing context - free languages is so much more efficient than parsing less restricted languages , we might want to go ahead and pretend English is contexi- free even if it means finding a number of parses that are not really ...
Página 325
... Parsing a sentence into a conceptual dependency representation is similar to the process of parsing using a case grammar . In both systems , the parsing process is heavily driven by a set of expectations that are set up on the basis of ...
... Parsing a sentence into a conceptual dependency representation is similar to the process of parsing using a case grammar . In both systems , the parsing process is heavily driven by a set of expectations that are set up on the basis of ...
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