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 45
Página 67
... match first . Sometimes a great many values satisfy each predicate but very few satisfy both . This example also ... Matching A more complex matching process SEC . 3.4 MATCHING 67.
... match first . Sometimes a great many values satisfy each predicate but very few satisfy both . This example also ... Matching A more complex matching process SEC . 3.4 MATCHING 67.
Página 70
... match , then the addition of such special - purpose rules will increase the size of the search rather than decrease it . In order to prevent that , we build the matcher so that it rejects rules that are more general than other rules ...
... match , then the addition of such special - purpose rules will increase the size of the search rather than decrease it . In order to prevent that , we build the matcher so that it rejects rules that are more general than other rules ...
Página 155
... matching rules are simple . Different constants , functions , or predicates cannot match ; identical ones can . A variable can match another variable , any constant , or a function or predicate expression , with the restriction that the ...
... matching rules are simple . Different constants , functions , or predicates cannot match ; identical ones can . A variable can match another variable , any constant , or a function or predicate expression , with the restriction that the ...
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