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 25
Página 153
... begin select- ing pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent that is likely to lead to the goal of producing the ...
... begin select- ing pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent that is likely to lead to the goal of producing the ...
Página 357
... begin by labeling all the boundary edges , as shown in Figure 10-15 ( b ) . Suppose we then begin labeling vertices at vertex 1. The only vertex label that is consistent with the known line labels is 13. At vertex 2 , the only ...
... begin by labeling all the boundary edges , as shown in Figure 10-15 ( b ) . Suppose we then begin labeling vertices at vertex 1. The only vertex label that is consistent with the known line labels is 13. At vertex 2 , the only ...
Página 410
... begin with examples of desired behavior in the form of input - output pairs . Others ( e.g. , [ Burstall , 1977 ; Manna , 1980 ] ) begin with formal specifications of the desired behavior . Still others begin with examples of execution ...
... begin with examples of desired behavior in the form of input - output pairs . Others ( e.g. , [ Burstall , 1977 ; Manna , 1980 ] ) begin with formal specifications of the desired behavior . Still others begin with examples of execution ...
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