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 28
Página 42
... hand , will need to be solved by a system that expends a great deal of effort making each decision , since the decision must be final . Some irrecoverable problems can be solved by recoverable style methods used in a planning process ...
... hand , will need to be solved by a system that expends a great deal of effort making each decision , since the decision must be final . Some irrecoverable problems can be solved by recoverable style methods used in a planning process ...
Página 82
... hand , we only care about getting to a solution somehow , we can define g always to be 0 , thus always choosing the node that seems closest to a goal . If we want to find a path involving the fewest number of steps , then we set the ...
... hand , we only care about getting to a solution somehow , we can define g always to be 0 , thus always choosing the node that seems closest to a goal . If we want to find a path involving the fewest number of steps , then we set the ...
Página 204
... HAND ISPART BODY FINGER ISPART HAND FINGERNAIL ISPART FINGER Both 204 STRUCTURED REPRESENTATIONS OF KNOWLEDGE CHAP . 7 Some Common Knowledge Structures.
... HAND ISPART BODY FINGER ISPART HAND FINGERNAIL ISPART FINGER Both 204 STRUCTURED REPRESENTATIONS OF KNOWLEDGE CHAP . 7 Some Common Knowledge Structures.
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