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 21
Página 277
... a particular level of granularity , out of which representations of particular pieces of information can be constructed . to man R I ATRANS book from where the symbols 277 Strong Slot-and-Filler Structures Conceptual Dependency.
... a particular level of granularity , out of which representations of particular pieces of information can be constructed . to man R I ATRANS book from where the symbols 277 Strong Slot-and-Filler Structures Conceptual Dependency.
Página 294
... conceptual dependency representation of the sentence John begged Mary for a pencil . How does this representation make it possible to answer the question Did John talk to Mary ? 2. One difficulty with representations that rely on a ...
... conceptual dependency representation of the sentence John begged Mary for a pencil . How does this representation make it possible to answer the question Did John talk to Mary ? 2. One difficulty with representations that rely on a ...
Página 406
... conceptual dependency ( CD ) structures . Parsing a sentence into a conceptual dependency representation is similar to the process of parsing using a case grammar . In both systems , the parsing process is heavily driven by a set of ...
... conceptual dependency ( CD ) structures . Parsing a sentence into a conceptual dependency representation is similar to the process of parsing using a case grammar . In both systems , the parsing process is heavily driven by a set of ...
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