Page 91 - DCAP310_INTRODUCTION_TO_ARTIFICIAL_INTELLIGENCE_AND_EXPERT_SYSTEMS

Unit 6: Formalized Symbolic Logics

6.13 Natural Language Computation Notes
6.13.1 Defining Natural Language
6.14 Summary
6.15 Keywords

6.16 Review Questions
6.17 Further Readings

Objectives

After studying this unit, you will be able to:
Explain the concept of Formalized Symbolic Logics

Discuss Syntax and Semantics for First-order Logic (FOL)
Describe the Well-Formed Formula (WFF)
Explain Conversion to Clausal Form

Identify the standard form of Rules of Inference
Discuss the concept of Resolution Logic
Identify various Deductive Inference Methods
Describe Truth Maintenance System
Discuss the Predicated Completion and Circumscription

Define Modal Logic
Define Temporal Logic
Explain the concept of Fuzzy Logic

Discuss the Natural Language Computation
Introduction

Mathematical logic (also symbolic logic, formal logic, or, less frequently, modern logic) is a
subfield of mathematics with close connections to the foundations of mathematics, theoretical
computer science and philosophical logic The field includes both the mathematical study of
logic and the applications of formal logic to other areas of mathematics. The unifying themes in
mathematical logic include the study of the expressive power of formal systems and the deductive
power of formal proof systems.
Mathematical logic is often divided into the fields of set theory, model theory, recursion theory,
and proof theory. These areas share basic results on logic, particularly first-order logic, and
definability. In computer science (particularly in the ACM Classification), mathematical logic
encompasses additional topics not detailed in this article; see logic in computer science for
those.

Since its inception, mathematical logic has both contributed to, and has been motivated by, the
study of foundations of mathematics. This study began in the late 19th century with the
development of axiomatic frameworks for geometry, arithmetic, and analysis. In the early 20th
century, it was shaped by David Hilbert’s program to prove the consistency of foundational

LOVELY PROFESSIONAL UNIVERSITY 85