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 34
Página 95
... constraint inference rules to the selected node to generate all possible new constraints . 3. If the set of constraints contains a contradiction , then report that this path is a deadend . 4. If the set of constraints describes a ...
... constraint inference rules to the selected node to generate all possible new constraints . 3. If the set of constraints contains a contradiction , then report that this path is a deadend . 4. If the set of constraints describes a ...
Página 96
... constraints . Then choose another rule to generate an ad- ditional assignment , which will , in turn , generate new constraints at the next cycle . Of course , at each cycle , there may be several choices of rules to apply . A few ...
... constraints . Then choose another rule to generate an ad- ditional assignment , which will , in turn , generate new constraints at the next cycle . Of course , at each cycle , there may be several choices of rules to apply . A few ...
Página 356
... constraint satisfaction procedure described in Section 3.6.7 . The main idea behind this procedure , often called the Waltz algorithm [ Waltz , 1975 ] , is to exploit constraints as soon as they are identified so that the number of ...
... constraint satisfaction procedure described in Section 3.6.7 . The main idea behind this procedure , often called the Waltz algorithm [ Waltz , 1975 ] , is to exploit constraints as soon as they are identified so that the number of ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraint contains database described discussed domain example expert systems exploit explore fact frame game tree given grammar graph heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP Marcus match minimax move MTRANS MYCIN node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production systems PROLOG propositional logic question reasoning representing knowledge resolution rules satisfied script search procedure search process Section semantic net semantic nets sentence shown in Figure simple situation slots solution solve specific statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding UNSTACK variable variety vertex