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 12
Página 214
... system . 7.5.2 Justification - Based Truth Maintenance Systems The idea of a truth maintenance system or TMS [ Doyle , 1979 ] arose as a way of providing the ability to do dependency - directed backtracking and so to support ...
... system . 7.5.2 Justification - Based Truth Maintenance Systems The idea of a truth maintenance system or TMS [ Doyle , 1979 ] arose as a way of providing the ability to do dependency - directed backtracking and so to support ...
Página 221
... TMS , in which , although the first three of these operations must still be performed by the problem - solving system , the last can be performed by the TMS . 7.5.3 Logic - Based Truth Maintenance Systems A logic - based truth maintenance ...
... TMS , in which , although the first three of these operations must still be performed by the problem - solving system , the last can be performed by the TMS . 7.5.3 Logic - Based Truth Maintenance Systems A logic - based truth maintenance ...
Página 549
... system can exploit a justification - based truth maintenance system to revise its model of the circuit . The first rule shown here says that an element ... truth maintenance systems , and 20.2 . EXPERT SYSTEM SHELLS 549 Expert System Shells.
... system can exploit a justification - based truth maintenance system to revise its model of the circuit . The first rule shown here says that an element ... truth maintenance systems , and 20.2 . EXPERT SYSTEM SHELLS 549 Expert System Shells.
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