Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 85
Página 107
... fact , they are often not even functions but rather many - to - many relations . ( In other words , each object in ... fact , namely that every dog has at least one tail . On the other hand , the former could represent either the fact ...
... fact , they are often not even functions but rather many - to - many relations . ( In other words , each object in ... fact , namely that every dog has at least one tail . On the other hand , the former could represent either the fact ...
Página 108
... fact that each domino must cover exactly one white square and one black square . Even for human problem solvers a ... fact ) and that it is onto ( i.e. , there is at least one representation for every fact ) . Unfortunately , in many AI ...
... fact that each domino must cover exactly one white square and one black square . Even for human problem solvers a ... fact ) and that it is onto ( i.e. , there is at least one representation for every fact ) . Unfortunately , in many AI ...
Página 176
... fact with the predicate apartment pet or a rule with that predicate as its head . Usually PROLOG programs are written with the facts containing a given predicate coming before the rules for that predicate so that the facts can be used ...
... fact with the predicate apartment pet or a rule with that predicate as its head . Usually PROLOG programs are written with the facts containing a given predicate coming before the rules for that predicate so that the facts can be used ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space