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 76
Página 84
... applies to graphs . It can , of course , be simplified to apply to trees by not bothering to check whether a new node is already on OPEN or CLOSED . This makes it faster to generate nodes , but may result in the same search being ...
... applies to graphs . It can , of course , be simplified to apply to trees by not bothering to check whether a new node is already on OPEN or CLOSED . This makes it faster to generate nodes , but may result in the same search being ...
Página 96
... apply . A few useful heuristics can help to select the best rule to apply first . For example , if there is a letter that has only two possible values and another with six possible values , there is a better chance of guessing right on ...
... apply . A few useful heuristics can help to select the best rule to apply first . For example , if there is a letter that has only two possible values and another with six possible values , there is a better chance of guessing right on ...
Página 368
... apply GPS to the problem of discovering a good set of differences to be used by another copy of GPS working in a ... application domain . 2. Define a goal for the learning task . This goal is to produce a good set of differences for the ...
... apply GPS to the problem of discovering a good set of differences to be used by another copy of GPS working in a ... application domain . 2. Define a goal for the learning task . This goal is to produce a good set of differences for the ...
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