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 41
Página 59
... theorems to axioms . This suggests that it would be much better to reason back- ward when trying to prove theorems . Mathematicians have long realized this [ Polya , 1957 ] , as have the designers of theorem - proving programs . One of ...
... theorems to axioms . This suggests that it would be much better to reason back- ward when trying to prove theorems . Mathematicians have long realized this [ Polya , 1957 ] , as have the designers of theorem - proving programs . One of ...
Página 167
... theorem proving that corresponds more closely to the processes used in human theorem proving . We are thus led to what we call , mostly by definition , natural deduction . Natural deduction is not a precise term . Rather it describes a ...
... theorem proving that corresponds more closely to the processes used in human theorem proving . We are thus led to what we call , mostly by definition , natural deduction . Natural deduction is not a precise term . Rather it describes a ...
Página 396
... theorems , that describe backward or goal - directed reasoning . An example of a consequent theorem is [ CONSEQUENT ( PART $ ? X $ ? Z ) ( GOAL ( PART $ ? X $ ? Y ) ) ( GOAL ( PART $ ? Y $ ? Z ) ) ] This theorem says that if you want to ...
... theorems , that describe backward or goal - directed reasoning . An example of a consequent theorem is [ CONSEQUENT ( PART $ ? X $ ? Z ) ( GOAL ( PART $ ? X $ ? Y ) ) ( GOAL ( PART $ ? Y $ ? Z ) ) ] This theorem says that if you want to ...
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