Page 130 - DCAP310_INTRODUCTION_TO_ARTIFICIAL_INTELLIGENCE_AND_EXPERT_SYSTEMS
P. 130

Introduction to Artificial Intelligence & Expert Systems




                    Notes              Propositional logic is a formal system in mathematics and logic. Other names for the
                                       system are propositional calculus and sentential calculus.

                                       Reason maintenance is a knowledge representation approach to efficient handling of
                                       inferred information that is explicitly stored.
                                       Symbolic Logic is designed to cultivate research on the borders of logic, philosophy, and
                                       the sciences, and to support substantive interactions between these disciplines.

                                       The clausal normal form (or clause normal form, conjunctive normal form, CNF) of a
                                       logical formula is used in logic programming and many theorem proving systems.

                                   6.15 Keywords

                                   Chomsky-type Grammars: Within the field of computer science, specifically in the area of formal
                                   languages, the Chomsky hierarchy (occasionally referred to as Chomsky – Schützenberger
                                   hierarchy) is a containment hierarchy of classes of formal grammars.
                                   Disjunctions: Logical disjunction is an operation on two logical values, typically the values of
                                   two propositions, that produces a value of false if and only if both of its operands are false. More
                                   generally a disjunction is a logical formula that can have one or more literals separated only by
                                   ORs. A single literal is often considered to be a degenerate disjunction.
                                   Domain: The term domain can refer either to a local sub-network or to descriptors for sites on
                                   the Internet.

                                   Inference Engine: In computer science, and specifically the branches of knowledge engineering
                                   and artificial intelligence, an inference engine is a computer program that tries to derive answers
                                   from a knowledge base. It is the “brain” that expert systems use to reason about the information
                                   in the knowledge base for the ultimate purpose of formulating new conclusions.
                                   Non-classical Logics: A non-classical logic (and sometimes alternative logics) is the name given
                                   to formal systems which differ in a significant way from standard logical systems such as
                                   propositional and predicate logic
                                   Topology: The physical topology of a network refers to the configuration of cables, computers,
                                   and other peripherals.

                                   6.16 Review Questions

                                   1.  Explain syntax logic with an example.
                                   2.  Define FOL.
                                   3.  What is the purpose of well-formed formula (WFF)?

                                   4.  Describe the clausal normal form and its conversion.
                                   5.  Write the inference rule. Explain each rule.
                                   6.  Explain the resolution logic with an example.
                                   7.  Write few lines on truth maintenance system.
                                   8.  Describe the purpose of circumscription logic.
                                   9.  Why does the point wise circumscription use?
                                   10.  Explain Fuzzy Logic with an example.

                                   11.  Enumerate NLP with an example.
                                   12.  Draw a Fuzzy Logic Transition Diagram.



          124                               LOVELY PROFESSIONAL UNIVERSITY
   125   126   127   128   129   130   131   132   133   134   135