Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 85
Página 133
... predicate logic ( or just predicate logic , since we do not discuss higher order theories in this chapter ) as a way of repre- senting knowledge because it permits representations of things that cannot reasonably be represented in ...
... predicate logic ( or just predicate logic , since we do not discuss higher order theories in this chapter ) as a way of repre- senting knowledge because it permits representations of things that cannot reasonably be represented in ...
Página 176
... predicate apartmentpet ( X ) . We state this goal to PROLOG as ? - apartmentpet ( X ) . Think of this as the input to the program . The PROLOG interpreter begins looking for a fact with the predicate apartmentpet or a rule with that ...
... predicate apartmentpet ( X ) . We state this goal to PROLOG as ? - apartmentpet ( X ) . Think of this as the input to the program . The PROLOG interpreter begins looking for a fact with the predicate apartmentpet or a rule with that ...
Página 207
... predicates can reasonably be assumed to be completely defined ( i.e. , the part of the world they describe is closed ) , but others cannot ( i.e. , the part of the world they describe is open ) . For example , the predicate has - a ...
... predicates can reasonably be assumed to be completely defined ( i.e. , the part of the world they describe is closed ) , but others cannot ( i.e. , the part of the world they describe is open ) . For example , the predicate has - a ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's