Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 57
Página 131
... Propositional logic is appealing because it is simple to deal with and a decision procedure for it exists . We can easily It is raining . RAINING It is sunny . SUNNY 131 Using Predicate Logic Representing Simple Facts in Logic.
... Propositional logic is appealing because it is simple to deal with and a decision procedure for it exists . We can easily It is raining . RAINING It is sunny . SUNNY 131 Using Predicate Logic Representing Simple Facts in Logic.
Página 133
... predicate logic ( or just predicate logic , since we do not discuss higher order theories in this chapter ) as a way of repre- senting knowledge because it permits representations of things that cannot reasonably be represented in ...
... predicate logic ( or just predicate logic , since we do not discuss higher order theories in this chapter ) as a way of repre- senting knowledge because it permits representations of things that cannot reasonably be represented in ...
Página 201
... Logic One system that provides a basis for default reasoning is Nonmonotonic Logic ( NML ) [ McDermott and Doyle , 1980 ] , in which the language of first - order predicate logic is augmented with a modal operator M , which can be read ...
... Logic One system that provides a basis for default reasoning is Nonmonotonic Logic ( NML ) [ McDermott and Doyle , 1980 ] , in which the language of first - order predicate logic is augmented with a modal operator M , which can be read ...
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