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 17
Página 59
... axioms . So the branching factor is significantly greater going forward from the axioms to the theorems than it is going backward from theorems to axioms . This suggests that it would be much better to reason back- ward when trying to ...
... axioms . So the branching factor is significantly greater going forward from the axioms to the theorems than it is going backward from theorems to axioms . This suggests that it would be much better to reason back- ward when trying to ...
Página 153
... Axioms Converted to Clause Form р ( p Ʌ q ) → r ( s vt ) → q t Figure 5-7 : p ~ p V ~ q Vr ~ S V ~ t V q t A Few Facts in Propositional Logic 12345 Let's look at a simple example . Suppose we are given the axioms shown in the first ...
... Axioms Converted to Clause Form р ( p Ʌ q ) → r ( s vt ) → q t Figure 5-7 : p ~ p V ~ q Vr ~ S V ~ t V q t A Few Facts in Propositional Logic 12345 Let's look at a simple example . Suppose we are given the axioms shown in the first ...
Página 253
... axiom . ( In all the axioms given in this sec- tion , all variables are universally quantified unless otherwise indicated . ) [ CLEAR ( x , s ) ^ ON ( x , y , s ) ] [ HOLDING ( x , DO ( UNSTACK ( x , y ) , s ) ) A CLEAR ( y , DO ...
... axiom . ( In all the axioms given in this sec- tion , all variables are universally quantified unless otherwise indicated . ) [ CLEAR ( x , s ) ^ ON ( x , y , s ) ] [ HOLDING ( x , DO ( UNSTACK ( x , y ) , s ) ) A CLEAR ( y , DO ...
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