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 26
Página 58
... factor ( i.e. , the average number of nodes that can be reached directly from a single node ) greater ? We would like to proceed in the direction with the lower branching factor . • Will the program be asked to justify its reasoning ...
... factor ( i.e. , the average number of nodes that can be reached directly from a single node ) greater ? We would like to proceed in the direction with the lower branching factor . • Will the program be asked to justify its reasoning ...
Página 59
... factor is approximately the same in both directions . When the branching factor is not the same , however , it must also be taken into account . Consider again the problem of proving theorems in some particular domain of mathematics ...
... factor is approximately the same in both directions . When the branching factor is not the same , however , it must also be taken into account . Consider again the problem of proving theorems in some particular domain of mathematics ...
Página 378
... factor of the concepts involved : Interestingness factor of " Divisors - of " raised from 300 to 400. Interestingness factor of " Numbers- with - 2 - divisors " raised from 100 to 600. Interestingness factor of " Numbers- with - 3 ...
... factor of the concepts involved : Interestingness factor of " Divisors - of " raised from 300 to 400. Interestingness factor of " Numbers- with - 2 - divisors " raised from 100 to 600. Interestingness factor of " Numbers- with - 3 ...
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