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 9
Página 94
... subgoals . A simple example of this failure is shown in Figure 3-21 . Assuming that both node C and node E ... sub- goals will be presented . 3.6.7 Constraint Satisfaction Many problems in A.I. can be viewed as problems of constraint ...
... subgoals . A simple example of this failure is shown in Figure 3-21 . Assuming that both node C and node E ... sub- goals will be presented . 3.6.7 Constraint Satisfaction Many problems in A.I. can be viewed as problems of constraint ...
Página 267
... subgoals have already been satisfied . Then it finds all the operators that might satisfy the final subgoal . Of course , each of them may have preconditions that must be met , so a new combined goal must be generated including those ...
... subgoals have already been satisfied . Then it finds all the operators that might satisfy the final subgoal . Of course , each of them may have preconditions that must be met , so a new combined goal must be generated including those ...
Página 289
... subgoals whose success would enable the rules to be invoked . These subgoals are again matched against rules , and their preconditions are SEC . 8.3 EXPERT SYSTEMS 289.
... subgoals whose success would enable the rules to be invoked . These subgoals are again matched against rules , and their preconditions are SEC . 8.3 EXPERT SYSTEMS 289.
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