Page 129 - DCAP310_INTRODUCTION_TO_ARTIFICIAL_INTELLIGENCE_AND_EXPERT_SYSTEMS

Unit 6: Formalized Symbolic Logics

For example, German capitalizes all nouns, regardless of whether they refer to names, Notes
and French and Spanish do not capitalize names that serve as adjectives.

Natural Language Generation: Convert information from computer databases into
readable human language.
Natural Language Understanding: Convert chunks of text into more formal representations
such as first-order logic structures that are easier for computer programs to manipulate.
Natural language understanding involves the identification of the intended semantic
from the multiple possible semantics which can be derived from a natural language
expression which usually takes the form of organized notations of natural languages
concepts. Introduction and creation of language meta model and ontology are efficient
however empirical solutions. An explicit formalization of natural languages semantics
without confusions with implicit assumptions such as Closed World Assumption (CWA)
vs. open world assumption, or subjective Yes/No vs. objective True/False is expected for
the construction of a basis of semantics formalization.

!
Caution Natural Language processing can be done if better algorithm is designed.

Task Apply NLP to find the trait of human.

Self Assessment

State whether the following statements are true or false:
25. Co reference resolution produce a readable summary of a chunk of text.
26. Morphological segmentation separate words into individual morphemes and identify the
class of the morphemes.

6.14 Summary

A formal language can be thought of as identical to the set of its well-formed formulas.
The set of well-formed formulas may be broadly divided into theorems and non-theorems.

A variation, closely related to Temporal or Chronological or Tense logics, are Modal
logics based upon “topology”, “place”, or “spatial position”.
A well-formed formula, shortly WFFS, often simply formula, is a word (i.e. a finite
sequence of symbols from a given alphabet) which is part of a formal language.
Fuzzy logic is an approach to computing based on “degrees of truth” rather than the usual
“true or false” (1 or 0) Boolean logic on which the modern computer is based. Natural
language (like most other activities in life and indeed the universe) is not easily translated
into the absolute terms of 0 and 1.

In logic, a rule of inference, inference rule, or transformation rule is the act of drawing a
conclusion based on the form of premises interpreted as a function which takes premises,
analyses their syntax, and returns a conclusion (or conclusions).
In mathematical logic and automated theorem proving, resolution is a rule of inference
leading to a refutation theorem-proving technique for sentences in propositional logic
and first-order logic.

LOVELY PROFESSIONAL UNIVERSITY 123