Artificial IntelligenceA revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
From inside the book
Results 1-3 of 55
Page 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.
Page 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 ...
Page 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 ...
Contents
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Copyright | |
25 other sections not shown
Other editions - View all
Common terms and phrases
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