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 89
Page 288
... specific properties of the information stored in a script , such as the causal chain represented by the events it contains . Thus although scripts are less general structures than are frames , and so are not suitable for representing ...
... specific properties of the information stored in a script , such as the causal chain represented by the events it contains . Thus although scripts are less general structures than are frames , and so are not suitable for representing ...
Page 298
... specific types of arcs present in the network . ( For example , isa links are treated differently from most other kinds of links . ) Frame systems are typically more highly structured than are semantic nets , and they contain an even ...
... specific types of arcs present in the network . ( For example , isa links are treated differently from most other kinds of links . ) Frame systems are typically more highly structured than are semantic nets , and they contain an even ...
Page 556
... specific char- acteristics of the system . ⚫ It is possible to extract the nondomain - specific parts from existing expert systems and use them as tools for building new systems in new domains . Four major problems facing current ...
... specific char- acteristics of the system . ⚫ It is possible to extract the nondomain - specific parts from existing expert systems and use them as tools for building new systems in new domains . Four major problems facing current ...
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