Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 34
Página 298
... syntactic . Their rules of inference are strictly syntactic procedures that operate on well - formed formulas ( wff ) regardless of what those formulas represent . Production rule systems are primarily syntactic also . The interpreters ...
... syntactic . Their rules of inference are strictly syntactic procedures that operate on well - formed formulas ( wff ) regardless of what those formulas represent . Production rule systems are primarily syntactic also . The interpreters ...
Página 403
... syntactic parse can be avoided since some of the interpretations do not make sense semantically and thus cannot be generated by a semantic grammar . Consider , for example , the sentence " I want to print stuff.txt on printer3 ...
... syntactic parse can be avoided since some of the interpretations do not make sense semantically and thus cannot be generated by a semantic grammar . Consider , for example , the sentence " I want to print stuff.txt on printer3 ...
Página 410
... syntactic parsing process , there is a corresponding step in semantic interpretation . Each time syntactic constituents are combined to form a larger syntactic unit , their corresponding semantic interpretations can be combined to form ...
... syntactic parsing process , there is a corresponding step in semantic interpretation . Each time syntactic constituents are combined to form a larger syntactic unit , their corresponding semantic interpretations can be combined to form ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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