Page 48 - DCAP310_INTRODUCTION_TO_ARTIFICIAL_INTELLIGENCE_AND_EXPERT_SYSTEMS
P. 48

Introduction to Artificial Intelligence & Expert Systems




                    Notes          rule, or transformation rule is the act of drawing a conclusion based on the form of premises
                                   interpreted as a function which takes premises, analyzes their syntax, and returns a conclusion
                                   (or conclusions). For example, the rule of inference modus ponens takes two premises, one in
                                   the form of “If p then q” and another in the form of “p” and returns the conclusion “q”. The rule
                                   is valid with respect to the semantics of classical logic (as well as the semantics of many other
                                   non-classical logics), in the sense that if the premises are true (under an interpretation) then so
                                   is the conclusion.
                                   Typically, a rule of inference preserves truth, a semantic property. In many-valued logic, it
                                   preserves a general designation. But a rule of inference’s action is purely syntactic, and does not
                                   need to preserve any semantic property: any function from sets of formulae to formulae counts
                                   as a rule of inference. Usually only rules that are recursive are important; i.e. rules such that
                                   there is an effective procedure for determining whether any given formula is the conclusion of
                                   a given set of formulae according to the rule. An example of a rule that is not effective in this
                                   sense is the infinitary rule.




                                      Task  Critically examine the importance of chaining in behavioral psychology.


                                   Self Assessment

                                   State whether the following statements are true or false:
                                   4.  Knowledge management represents a logical progression beyond information
                                       management.

                                   5.  MYCIN is not an expert system.
                                   6.  A good knowledge representation covers intelligent activity which uses the knowledge
                                       base.


                                   3.3 Knowledge Manipulation

                                   The Knowledge Query and Manipulation Language, or KQML, is a language and protocol for
                                   communication among software agents and knowledge-based systems. It was developed in the
                                   early 1990s part of the DARPA knowledge Sharing Effort, which was aimed at developing
                                   techniques for building large-scale knowledge bases which are shareable and reusable. While
                                   originally conceived of as an interface to knowledge based systems, it was soon repurposed as
                                   an Agent communication language.
                                   Decisions and actions in knowledge based systems come from manipulation of the knowledge.
                                   The known facts in the knowledge base be located, compared, and altered in some way. This
                                   process may set up other sub-goals and require further inputs, and so on until a final solution is
                                   found. The manipulations are the computational equivalent of reasoning. This requires a form
                                   of inference or deduction, using the knowledge and inferring rules. All forms of reasoning
                                   requires a certain amount of searching and matching. The searching and matching operations
                                   consume greatest amount of computation time in AI systems. It is important to have techniques
                                   that limit the amount of search and matching required to complete any given task.

                                   3.3.1 The Turing Test

                                   The Turing test is a test of a machine’s ability to exhibit intelligent behavior equivalent to, or
                                   indistinguishable from, that of an actual human. In the original illustrative example, a human



          42                                LOVELY PROFESSIONAL UNIVERSITY
   43   44   45   46   47   48   49   50   51   52   53