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 79
Página 205
... idea of a minimal model . Recall from the beginning of this section that a model of a set of formulas is an interpretation that satisfies them . Although there are several distinct definitions of what constitutes a minimal model , for ...
... idea of a minimal model . Recall from the beginning of this section that a model of a set of formulas is an interpretation that satisfies them . Although there are several distinct definitions of what constitutes a minimal model , for ...
Página 410
... idea was that it produces structures that correspond to the structures that should result from semantic processing . If we investigate this idea more closely , we arrive at a notion called compositional semantics . The main idea behind ...
... idea was that it produces structures that correspond to the structures that should result from semantic processing . If we investigate this idea more closely , we arrive at a notion called compositional semantics . The main idea behind ...
Página 445
... idea , namely the bidding that is exploited in the contract net framework . See Fox [ 1981 ] , Malone [ 1987 ] , and Kornfeld and Hewitt [ 1981 ] for further discussion of this idea . Another source of ideas is the way a single human ...
... idea , namely the bidding that is exploited in the contract net framework . See Fox [ 1981 ] , Malone [ 1987 ] , and Kornfeld and Hewitt [ 1981 ] for further discussion of this idea . Another source of ideas is the way a single human ...
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