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 41
Página 56
... initial state and ending in one or more final states . This graph that must be searched could , in principle , be constructed in its entirety from the rules that define allowable moves in the problem space . But , in practice , most of ...
... initial state and ending in one or more final states . This graph that must be searched could , in principle , be constructed in its entirety from the rules that define allowable moves in the problem space . But , in practice , most of ...
Página 57
... initial state is generated . This method of chaining back- ward from the desired final state is often called goal - directed reasoning or backchaining . Notice that the same rules can be used both to reason forward from the initial ...
... initial state is generated . This method of chaining back- ward from the desired final state is often called goal - directed reasoning or backchaining . Notice that the same rules can be used both to reason forward from the initial ...
Página 270
... initial state . At that point , it is known that no operators need be applied before the sequence that has just been found can begin . Thus the entire initial state can be assumed still to be true . Of course , we could still use ...
... initial state . At that point , it is known that no operators need be applied before the sequence that has just been found can begin . Thus the entire initial state can be assumed still to be true . Of course , we could still use ...
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 branching factor breadth-first search Chapter chess clauses CLEAR(A complete Computer concept conceptual dependency consider constraints contains database described discussed domain example expert systems exploit explore fact frame game tree goal grammar graph heuristic heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP machine Marcus match methods minimax move MYCIN natural language 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 variety