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 4
Página 353
... vertex is not significant , nor are the sizes of the angles it contains , except that the distinc- tion between ... vertices that can occur SEC . 10.3 CONSTRAINT SATISFACTION - THE WALTZ ALGORITHM 353.
... vertex is not significant , nor are the sizes of the angles it contains , except that the distinc- tion between ... vertices that can occur SEC . 10.3 CONSTRAINT SATISFACTION - THE WALTZ ALGORITHM 353.
Página 357
... vertices at vertex 1. The only vertex label that is consistent with the known line labels is 13. At vertex 2 , the only consistent label is 6. At each of the remaining boundary vertices , there is also only one labeling choice . These ...
... vertices at vertex 1. The only vertex label that is consistent with the known line labels is 13. At vertex 2 , the only consistent label is 6. At each of the remaining boundary vertices , there is also only one labeling choice . These ...
Página 359
... vertex V all the labelings that might be able to be attached to it . Then we looked at all adjacent vertices in an attempt to constrain the set of labelings associated with V. And then we went back to each adjacent vertex A to see if ...
... vertex V all the labelings that might be able to be attached to it . Then we looked at all adjacent vertices in an attempt to constrain the set of labelings associated with V. And then we went back to each adjacent vertex A to see if ...
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