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 81
Página 34
... called combinatorial explosion . To combat it , a new control strategy is needed . We can beat the strategy outlined above using a technique called branch- and - bound . Begin generating complete paths , keeping track of the shortest ...
... called combinatorial explosion . To combat it , a new control strategy is needed . We can beat the strategy outlined above using a technique called branch- and - bound . Begin generating complete paths , keeping track of the shortest ...
Página 230
... called an if - added procedure ) or how a value for a slot can be computed if it is required . ( often called an if - needed or to - establish procedure ) . The use of such procedures embedded within an otherwise declarative structure is ...
... called an if - added procedure ) or how a value for a slot can be computed if it is required . ( often called an if - needed or to - establish procedure ) . The use of such procedures embedded within an otherwise declarative structure is ...
Página 309
... called the total vocabulary . • Σ is a nonempty subset of V called the terminal alphabet . Call V - Σ the nonterminal alphabet N. • P is a finite set of productions of the form α B , where a Є V * NV * and BЄ V * * is the Kleene - star ...
... called the total vocabulary . • Σ is a nonempty subset of V called the terminal alphabet . Call V - Σ the nonterminal alphabet N. • P is a finite set of productions of the form α B , where a Є V * NV * and BЄ V * * is the Kleene - star ...
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