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 27
Página 149
... begin selecting pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent that is likely to lead to the goal of producing the ...
... begin selecting pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent that is likely to lead to the goal of producing the ...
Página 175
Elaine Rich, Kevin Knight. " begin with upper case letters and all constants begin with lower case letters or numbers . 2. In logic , there are explicit symbols for and ( ^ ) and or ( V ) . In PROLOG , there is an explicit symbol for and ...
Elaine Rich, Kevin Knight. " begin with upper case letters and all constants begin with lower case letters or numbers . 2. In logic , there are explicit symbols for and ( ^ ) and or ( V ) . In PROLOG , there is an explicit symbol for and ...
Página 388
... Begin with the start symbol and apply the grammar rules forward until the symbols at the terminals of the tree correspond to the components of the sentence being parsed . • Bottom - Up Parsing - Begin with the sentence to be parsed and ...
... Begin with the start symbol and apply the grammar rules forward until the symbols at the terminals of the tree correspond to the components of the sentence being parsed . • Bottom - Up Parsing - Begin with the sentence to be parsed and ...
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