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 43
Página 77
... exists a solution , then there exists a path of finite length , say N , from a start state to a goal state . The breadth - first search will explore all paths of length 1 , of which there are a finite number . It will then look at all ...
... exists a solution , then there exists a path of finite length , say N , from a start state to a goal state . The breadth - first search will explore all paths of length 1 , of which there are a finite number . It will then look at all ...
Página 139
... exist procedures that will find a proof of a proposed theorem if indeed it is a theorem , but they are not guaranteed to halt if the proposed statement is not a theorem . A simple such procedure is to use the rules of inference to ...
... exist procedures that will find a proof of a proposed theorem if indeed it is a theorem , but they are not guaranteed to halt if the proposed statement is not a theorem . A simple such procedure is to use the rules of inference to ...
Página 152
... exists , then eventually it will be found . Of course , if no contradiction exists , it is possible that the procedure will never terminate , although as we will see , there are often ways of detecting that no contradiction exists . So ...
... exists , then eventually it will be found . Of course , if no contradiction exists , it is possible that the procedure will never terminate , although as we will see , there are often ways of detecting that no contradiction exists . So ...
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