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 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 252
... apply next based on the best available heuristic information . • Apply the chosen rule to compute the new problem state that arises from its application . • Detect when a solution has been found . • Detect deadends so that they can be ...
... apply next based on the best available heuristic information . • Apply the chosen rule to compute the new problem state that arises from its application . • Detect when a solution has been found . • Detect deadends so that they can be ...
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 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