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 16
Página 39
... Blocks World Problem Now consider the problem illustrated in Figure 2-8 . This problem is drawn from the domain often referred to in A.I. literature as the blocks world . On ( B , C ) and on ( A , B ) On ( B , C ) On ( A , B ) Put B on ...
... Blocks World Problem Now consider the problem illustrated in Figure 2-8 . This problem is drawn from the domain often referred to in A.I. literature as the blocks world . On ( B , C ) and on ( A , B ) On ( B , C ) On ( A , B ) Put B on ...
Página 40
... [ block X has nothing on it ] → ON ( X , Table ) [ pick up X and put it on the table ] 2. CLEAR ( X ) AND CLEAR ( Y ) → ON ( X , Y ) [ put X on Y ] Applying the technique of problem decomposition to this simple blocks world example ...
... [ block X has nothing on it ] → ON ( X , Table ) [ pick up X and put it on the table ] 2. CLEAR ( X ) AND CLEAR ( Y ) → ON ( X , Y ) [ put X on Y ] Applying the technique of problem decomposition to this simple blocks world example ...
Página 261
... blocks world axiom that says that any block with no blocks on it is clear , a theorem prover could derive CLEAR ( B ) . So that goal , too , can be popped from the stack . The third of UNSTACK ( B , A ) ' s preconditions remains . It ...
... blocks world axiom that says that any block with no blocks on it is clear , a theorem prover could derive CLEAR ( B ) . So that goal , too , can be popped from the stack . The third of UNSTACK ( B , A ) ' s preconditions remains . It ...
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