\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Guideline for Including Unperceivable Knowledge in a Universal Ontology Experimentation Field: Ontology Malagasy},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{1970-01-01 (revised: 01 January 1970)}
\def\TheID{\makeatother }
\def\TheDate{1970-01-01}
\title{Guideline for Including Unperceivable Knowledge in a Universal Ontology Experimentation Field: Ontology Malagasy}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Randriambololona  Nivo}

             \author[2]{Andriamanohisoa Hery  Zo}

\renewcommand\Authands{ and }

\date{\small \em Received: 1 January 1970 Accepted: 1 January 1970 Published: 1 January 1970}

\maketitle


\begin{abstract}
        


This article suggests a cognitive approach to initiate the inclusion of unperceivable worlds into established ontologies. We qualify as unperceivable any world that escapes automatic data exploration because of the leak of sufficient documentation. Initially based on knowledge engineering, the approach aims in the long term at the automatic production of knowledge vectors that can be assimilated to existing corpora. It leverages a proven and extendable universal ontology and is experienced in the emerging world of Malagasy culture.

\end{abstract}


\keywords{knowledge, ontologie, malagasy.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\begin{textblock*}{10cm}(1.05cm,3cm)
{{\textit{CrossRef DOI of original article:}} \underline{}}
\end{textblock*}\let\tabcellsep& 	 	 		 \par
he new paradigms of Artificial Intelligence (AI) rely on innovative techniques to solve problems that exceed human capacity and sometimes even the real needs of humanity. These techniques require the massive presence of data intended to train an agent on the resolution of a particular problem \hyperref[b2]{[3]}. An agent is no longer supposed to reason, instead he is supposed to learn and to automatically or statistically exploit the data made available to him in order to deduce the decision to be taken or the prediction that seems the most relevant \hyperref[b6]{[7]}. AI, endowed with data science, has become "almost" sovereign. Despite its power, there is a catch. What about unknown but emerging worlds for which no one has ever thought of collecting data but which today aspire to be part of the lot, to also be perceivable by AI? Nowadays, there are performant trained models like ChatGPT that have the ability to interact in a conversational way and that have response to all kinds of questions. Unfortunately, they are not yet trained on such emerging exotic worlds.\par
This article proposes a solution to circumvent the absence of massive data for a specific emerging world. The idea is to use classic AI techniques like knowledge engineering, while exploiting as far as possible what the state of the art offers in terms of ontology. As experimentation field, we opt for the unperceivable world of Malagasy culture and name the project Tontolo Malagasy. In fact, it is an abbreviation for Taxonomy and Ontology Malagasy. Tontolo means at the same time Universe. That is to say that we try to put the Malagasy Universe into an ontology and will let an agent respond spontaneously to the most important questions concerning the Malagasy language, news, (historical) facts, events or personalities of Madagascar. This is our manner to perpetuate the access to the own cultural identity for Malagasy youth. Latter is increasingly immersed in attractive cultures that certainly promote open-mindedness but that overwrite at the same time precious cultural heritage. Often, we are only aware of the value of our culture when it disappears. In the present work, we start by introducing the main concepts behind knowledge engineering. Then, we will present examples to illustrate their compilation on our project. Finally, we will talk about a state of the art ontology named YAGO which will serve as a reference. 
\section[{T}]{T}\par
Author ? ?: Laboratoire de recherche en sciences cognitives et applications (LRSCA) Université d'Antananarivo. e-mail: nivoran@gmail.com II. Introduction to the Concept of Knowledge Knowledge comes to us not only from the information that is conveyed by our perceptions, but also by natural language. Traditionally, natural language is considered as a language for representing knowledge, but today we see it more as a medium of communication. Even if it is highly expressive, hypotheses revealthe delicacy of its use.\par
? The Sapir-Whorf hypothesis  {\ref (1956)} claims that the language we speak greatly influences our understanding of the world. In the language Guugu Yimithirr of the Aborigines in Australia, for example, there are no words to express the relative direction (such as left, right, ahead, behind) but only the absolute direction via the use of the cardinal points (north, south, east, west). Therefore, Aborigines excel at navigating open terrain but would be less comfortable if told to turn left in a corridor. ? Words are sometimes associated with non-verbal representations. In some cultures, a concept may be completely absent from the language (like the example told above). In the Malagasy language, the verb to be does not exist. However, in a sentence supposed to mean it implicitly, anyone speaking Malagasy would understand it. Since language influences the apprehension of the world, knowledge is not always neutral, objective or complete. This reinforces our assertion regarding the existence of unknown worlds. Existing ontologies are mainly imbued with Western culture, so as immense as they are, they are never complete \hyperref[b1]{[2]}. Before showing how to add new worlds into pre-established concepts, let us first see how to represent knowledge mathematically for the purpose of its automatic processing. 
\section[{a) Knowledge Base}]{a) Knowledge Base}\par
Our goal is to model a knowledge-based agent that can form representations of a real world. The task is not about actually representing everything in the world. New representations are derived from existing ones through inference processes. These new representations are used to deduce what to do. A knowledge base (KB) consists of a set of sentences that are expressed in a knowledge representation language. Each sentence corresponds to some assertion about the world. When the sentence is considered as given without being derived from other sentences, we call it an axiom. The KB may initially contain some background axioms. 
\section[{D}]{D}\par
? The standard operation ASK to query knowledge from KB. ? In the following section, we will study, how the expression of sentences and the definition of their semantics are achieved through logic.\par
b) Logic i. Syntax Logic governs the representation language and specifies through a grammar all the sentences that are syntactically correct (well-formed). According to \hyperref[b0]{[1]}, the syntax of First-Ordered-Logic is given in Figure 01.\par
According to \hyperref[b0]{[1]}, two types of operation are used to manage knowledge in a KB:\par
? The standard operation TELL to add new sentences to the KB ???????????????? ? ???????????????????????????? | ?????????????????????????????? ???????????????????????????? ? ?????????????????? | ??????????????????(????????, ? ) | ???????? = ???????? ?????????????????????????????? ? (????????????????)| [????????????????] | ¬???????????????? | ???????????????? ?? ???????????????? | ???????????????? ? ???????????????? | ???????????????? ? ???????????????? | ???????????????? ? ???????????????? | ????????????ð??"ð??"?????? ????????????????, ? ???????????????? ???????? ? ????????????????(????????)| ????????????????| ???????????????? ????????????ð??"ð??"?????? ? ? | ????????????????? ? ?? | ??1 | John | ? ???????????????? ? ?? | ?? |?? | ? ?????????????????? ? ???????? | ?????????? |??ð??"ð??"?????? | ?????????? |????????????ð??"ð??" | ? ???????????????? ? ??????????? | ????ð??"ð??"??????ð??"ð??" | ? ii. Semantics\par
A logic must also define the meaning (semantics) of sentences. Depending on the used logic, this task can be simple or more sophisticated. Propositional logic simply assumes that there are facts that either hold or do not hold in the world. Propositional logic has the advantage of using a declarative, context-independent and unambiguous semantics. It is sufficient to illustrate the basic concepts of logic and knowledge-based agents. Nevertheless, it is not suitable to represent knowledge of complex environments in a concise way. For this reason, first-order-logic is preferred. It builds a more expressive logic on the foundation of propositional logic, borrowing representational ideas from natural language and at the same time avoiding its disadvantages. Its language is built around objects and relations. It also forms the foundation of many other representation languages. 
\section[{iii. Model}]{iii. Model}\par
For every sentence, its truth or falsehood is specified through a model. The possible models are just all possible assignments to the concerned variables. If a sentence ? is true in model m, we say that m satisfies? or m is a model of ?. M(?) is the set of all models of ?. For example, the sentence a * 3 = 6 is true in a world where a is 2, but false in any other world. 
\section[{iv. Logical Entailment}]{iv. Logical Entailment}\par
Logical entailment is a relation between two sentences the second of which follows logically from the first one. It is the basis of logical reasoning. In mathematical notation, we write ? ?? ? to mean that the sentence ? entails the sentence ?. The formal definition of entailment is 
\section[{? ?? ? if and only if ??(??) ? ??(??)}]{? ?? ? if and only if ??(??) ? ??(??)}\par
In clear: ? ?? ? if and only if, in every model in which ? is true, ? is also true. 
\section[{v. Logical inference}]{v. Logical inference}\par
Entailment is applied to carry out logical inference (to derive conclusions). If an inference algorithm x can derive ? from KB, we write ???? ? ?? ??, which is pronounced "? is derived from KB by x" or "x derives ? from KB", where ? is just one possibility among the set of all consequences of KB.\par
An inference algorithm is called sound or truthpreserving if it derives only entailed sentences. An unsound inference procedure essentially announces the discovery of nonexistent or false conclusions.\par
An inference algorithm is called complete if it can derive any sentence that is entailed. 
\section[{vi. Grounding}]{vi. Grounding}\par
The connection between logical reasoning processes and the real environment of an agent is called grounding. Since KB is just a set of sentences inside the agent's mind, how do we know that KB is true in the real world? The agent program achieves grounding by creating a suitable sentence whenever a perceptible event occurs. Then, whenever that sentence is in the knowledge base, it is true in the real world. Let us directly illustrate with the example of Tontolo Malagasy. Tontolo Malagasy is expected to inform us about Malagasy culture (including historical facts and events, language, personalities, places). For simplicity in this example, we will observe a restricted world, namely the world of the former presidents of Madagascar. We will further narrow down to the observation of a single President, Zafy Albert, a deceased President (to avoid any political controversy).\par
We know furthermore that the legal duration of a presidential term is 5 years and that a President must be at least 18 years old. A President may nominate successively different Prime Ministers (PM) during his presidential term. 
\section[{Choice of the vocabulary to use for predicates, functions and constants}]{Choice of the vocabulary to use for predicates, functions and constants}\par
? The following predicates will be used: Person, President, Prime minister (PM). ? The following functions 1 will be used: BirthDate, DeathDate ? The following relations will be used: TermPeriod, Tenure ? The following constants will be used: Zafy Albert, Francisque Ravony, Emmanuel  {\ref Rakotovahiny, 1993} {\ref Rakotovahiny, , 1995} {\ref Rakotovahiny, , 1996}. Encoding general knowledge about the domain in the language of First-Order-Logic   {\ref (???????????????? ???????????????????????, 1995, 1996)} All this information (general or specific) encoded in the KB and to which others will be added via the agent'spercepts will remain simple sentences as long as no request comes to give them life. These are the queries that will trigger the inference procedure, which will use them as part of a sequence of entailments.1) ????????????(??) ? ????????????(??) ?( ????????2 -????????1) ? 5 ?? ????????????(??,\par
The goal of inference is to find out whether KB?? ? for some sentence ?. Compared to conventional databases, the reward with a knowledge base is that we can let the inference procedure operate on the axioms 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XXIII Issue II Version I Suppose the agent gets from any source the information that he was born on May 1 in 1927, that he died on October 13 in 2017 and that he had two prime ministers during his office: Francisque Ravony (term of office 1993 to 1995) and Emmanuel Rakotovahiny (term of office 1995 to 1996). and problem specific facts to drift by itself the fact we are interested in knowing. There are different inference algorithms like model checking, theorem proving, forward-chaining, Davis-Putnam algorithm, Hill-climbing search \hyperref[b0]{[1]}. They have respectively their advantages and their drawbacks but their studies are beyond the scope of the present article. An upcoming article will be dedicated to the explanation as well as the demonstration of the operating mode of an inference algorithm.\par
So far we have studied knowledge as an abstract and a general concept with an abstract representation language. In this abstract form, knowledge reuse and knowledge sharing will not be possible. In the following section, we will learn knowledge implementation through the use of ontologies. 
\section[{III. Ontology}]{III. Ontology}\par
In philosophy, the term ontology refers to the science that studies being as being. With the emergence of knowledge engineering and the Semantic Web, and emphasizing the importance of knowledge sharing and reuse, this definition has been extended. "An ontology is a formal specification of a shared conceptualization" \hyperref[b5]{[6]}. Ontology represents a means of materializing knowledge in a form and in a structure that makes its reuse and its sharing possible. 
\section[{a) Taxonomy}]{a) Taxonomy}\par
A general ontology organizes everything in the world into a hierarchy of categories -called a taxonomy -such as Events, Time, Physical objects and beliefs. The organization of objects into categories is a vital part of knowledge representation since much reasoning takes place at the level of categories. Categories permit also to make predictions about classified objects. A taxonomy has a tree structure.\par
Categories (or classes) serve to organize and simplify the knowledge base through inheritance. If we say that all instances of the category Persons have the property are Mortal, and if we assert that Women is a subclass of Persons and Mothers is a Subclass of Women, then our agent will know that every mother is mortal. We say that the individual woman inherit the property of mortality, in this case from their membership in the Persons category. 
\section[{b) Relationships}]{b) Relationships}\par
It is possible to bring more precisions into the characterization of the relations between categories. To state that two categories that are not subclasses of each other (e.g. Males and Females) have no members in common, we use the relation Disjoint: Disjoint (\{Males, Females\}). We can go further and precise that an animal that is not a male must be a female, and say therefore that males and females constitute an exhaustive decomposition of the animals. A disjoint exhaustive decomposition is known as a partition. Partition (\{Males, Females\}, Animals). We use the general Part Of relation to state that one thing is part of another. Through the introduction of such types of relations between categories, the tree becomes a graph. 
\section[{c) Named Entities}]{c) Named Entities}\par
For the purpose of our project, we need an ontology that should not only contain categories or concepts but also named entities designating among other people, organizations, places and other important things. It should be possible to establish relations between individuals of different kinds: What is located where? Who was born where? Which sovereign reigned during which period? 
\section[{d) Ontology Language}]{d) Ontology Language}\par
The best known languages to write ontologies are OWL (Web Ontology Language) and RDFS (Resource Description Framework Schema). Both are computational logic-based languages such that knowledge expressed in OWL or in RDFS can be exploited by computer programs.\par
In the following section, we present the YAGO model that is a slight extension of RDFS. it is designed to be extendable by other sources (high quality sources, domain-specific extensions, or data gathered through information extraction from Web pages), what makes it highly interesting for our project.\par
IV. Yago (Yet-Another-Great-Ontology)\par
YAGO was developed at the Max-Planck-Institute for Informatics in Germany. It is able to express entities, facts, relations between facts and properties of relations, while it is at the same time simple and decidable.In contrast to other existing ontologies, that are limited to a single source of background knowledge, YAGO combines high coverage with high quality \hyperref[b7]{[8]}. Its latest version YAGO 4 (2022) is a cleaned version of Wikidata that contains more than 50 million entities and 2 billion facts. 
\section[{a) The Components of YAGO}]{a) The Components of YAGO}\par
In YAGO, all objects (concepts) are represented as entities which are organized according to a taxonomy. The higher classes come from schema.org 2 and the lower classes from Wikidata. In the leaves of the tree, we no longer have classes but named entities, that is, concrete objects, individuals. We will refer to entities that are neither facts nor relations as common entities.\par
An ontology represents also relationships between entities that have no hierarchical link between them. Example: In "An author writes a book", there is no hierarchical link between author and book. The two concepts are related by "writing". YAGO does not only allow relationships between entities but even between relationships or between a relationship and an entity. This is possible by considering a relationship itself as an entity.\par
The triple of an entity, a relation and an entity is called a fact. They represent respectively a subject, a predicate, and an object. Example: yago: Zafy\textunderscore Albert rdf: type schema: Person. The two entities are called the arguments of the fact. In YAGO, each fact is given a fact identifier, that is one of its strengths.\par
To maintain the semantic integrity of the data, YAGO uses the SHACL 3 Standard which makes it possible to express semantic integrity constraints. 
\section[{b) Mathematical Definition of YAGO}]{b) Mathematical Definition of YAGO}\par
A YAGO ontology over a finite set of common entities C, a finite set of relation names R and a finite set of fact identifiers I is a function with the following definition:y ??: ?? ? (?? ?? ?? ?? ??) × ?? × (?? ?? ?? ?? ??)\par
For facts that require more than two arguments, it is assumed that for each n-ary relation, a primary pair of its arguments can be identified. The primary pair can be represented as a binary fact with a fact identifier: \#1: AlbertEinstein HASWONPRIZE NobelPrize. All other arguments can be represented as relations that hold between the primary pair and the other argument: \#2: \#1 TIME 1921. Now, it's time to see how to exploit YAGO for Tontolo Malagasy. 
\section[{c) Exploiting YAGO for Tontolo Malagasy}]{c) Exploiting YAGO for Tontolo Malagasy}\par
In the mass of YAGO data, there is very little portion of information on Malagasy culture. After a brief test, we noticed that out of 1,048,576 facts, only 80 mention Madagascar as a subject or as an object. In addition, there are specific Malagasy concepts and relationships that are totally unknown to YAGO. And finally, and obviously, YAGO does not understand the Malagasy language.\par
However, thanks to the flexibility of YAGO, including all these specificities that it currently lacks is not an impossible mission. There are three things we can do to enable YAGO extension on Tontolo Malagasy:\par
1. Data integration 2. Implicit translation 3. Implicit specification 
\section[{. Data integration}]{. Data integration}\par
The challenge is to know how to recognize everything that is essential to our project and also to know at what level we must act (adapt, adopt, add, personalize, withdraw). Actually we are more interested in the taxonomy and in the common entities than in the named entities or in the facts because we would like to contribute our own named entities and our own facts. However, it is quite tricky because even if Madagascar is an island, it is not isolated from the rest of the world, so we still have to leave room for everything related to the outside world. Let us for now mainly focus on persons, places and organizations. In the YAGO taxonomy, the class person has 1569 subclasses that correspond to 1569 different professions. They don't all interest us right away. We will start with a small number to be able to accommodate the historical and cultural characters of our knowledge base. Finally, here is an example of how to describe the President Zafy Albert in the language of YAGO. <Zafy\textunderscore Albert > rdf:type <wordnet\textunderscore president\textunderscore 110467179> <Zafy\textunderscore Albert> <hasGender> <male> <Zafy\textunderscore Albert > schema:birthDate <1927-05-01> <Zafy\textunderscore Albert > schema:deathDate <2017-10-13> <Zafy\textunderscore Albert > <isCitizenOf><Madagascar> 
\section[{. Implicit Translation}]{. Implicit Translation}\par
We have to create a new prefix-tontoloMG -to permit any extensions and to associate new relations. This step is necessary if we want to incorporate translations into Malagasy in our ontology.\par
The following relations will be used to indicate translation:\par
-mg\textunderscore classic: to associate a concept (entity, predicate, relation) with its translation into classic and official Malagasy. 
\section[{Example:}]{Example:}\par
President tontoloMG : mg\textunderscore classic Filoha <isMarriedTo> tontoloMG : mg\textunderscore classic '(dia) manambady an'i' -mg\textunderscore dialect: to associate a concept with its dialect-version. 
\section[{Example:}]{Example:}\par
Olona tontoloMG : mg\textunderscore dialect olo -mg\textunderscore familiar. to associate a concept with colloquial language. Colloquial language may includeforeign words or words of foreign origin. 
\section[{Here are some examples :}]{Here are some examples :}\par
Boy tontoloMG: mg\textunderscore familiar Kôfboay (from English: cow-boy) Money tontoloMG: mg\textunderscore familiar Sôsy 
\section[{. Implicit Specification}]{. Implicit Specification}\par
The mg\textunderscore specific relation will allow us to introduce into our ontology concepts specific to the Malagasy culture. They are necessarily expressed in Malagasy. In the official Malagasy language, for example, thereis no single word to designate an uncle or an aunt. The Malagasy specifies:\par
? If it is an uncle who is the eldest in the siblings, he is called dadatoa ? If it is an uncle who is the youngest in the siblings, he is called dadafara ? If it is an uncle who is somewhere inbetween, he is called dadanaivo In praxis however, certainly for simplicity, many people use familiar language which permit to call invariably an uncle Tonton (a French word). We would therefore write:\par
Uncle tontoloMG:mg\textunderscore specific Dadatoa |Dadanaivo| Dadafara Uncle tontoloMG:mg\textunderscore familiar Tonton 
\section[{v. Conclusion}]{v. Conclusion}\par
This project was motivated by the obvious exclusion of emerging worlds by the new paradigms of AI because of the lack of massive data describing them. These worlds are actually just as old as the world known to AI. It's just that they have never been taken into account because they are not part of dominantcultures. Consequently, there is very little, if any, data that could be exploited by statistics for the purpose of making decisions or making predictions automatically. The approach we propose to remedy this lack is cognitive in nature and relies on knowledge engineering. We are experimenting it on the case of Malagasy culture. Our objective is to build a historical and cultural knowledge base in order to conserve and preserve the essence of Malagasy cultural identity. We therefore adopt YAGO, a state-of-the-art ontology, and exploit it to the limit of the possible to then customize it manually and complete it with specific concepts and facts. By doing so, we also facilitate the integration of the Malagasy universe into an already multicultural ontology. Another very important achievement is the potential for using our ontology as an instrument for the automatic production of corpora in Malagasy language. We are aware that over time, as automatic processing advances on these emerging worlds, new, more sophisticated needs will arise that will need to be solved by contemporary AI techniques. In the meantime, we will have time to massively produce data (through projects like this one) so that we can one day catch up with the bandwagon. We must see in this type of project a way to start the road, where there is nothing, to facilitate the integration of emerging worlds into the known world so they can finally be detected by the new AI.  \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.7147058823529412\textwidth}P{0.008823529411764706\textwidth}P{0.049999999999999996\textwidth}P{0.055882352941176466\textwidth}P{0.020588235294117647\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \multicolumn{2}{l}{Here are some}\\
\multicolumn{5}{l}{examples of professions that we could integrate:}\\
\multicolumn{5}{l}{Ambassador, Contestant, Entrepreneur, Evangelist,}\\
Foreigner,\tabcellsep \multicolumn{2}{l}{Governer,}\tabcellsep Head\textunderscore of\textunderscore State,\tabcellsep Historian,\\
\multicolumn{4}{l}{Humanitarian, Leader, Sovereign?}\\
\multicolumn{5}{l}{Each person may be defined through}\\
\multicolumn{3}{l}{YAGO-predicates like}\tabcellsep \\
\multicolumn{5}{l}{<hasChild>, <hasGivenName>, <isCitizenOf>,}\\
\multicolumn{5}{l}{<hasFamilyName>, <wasBornIn>, <isMarriedTo>,}\\
\multicolumn{5}{l}{<worksAt>, <isLeaderOf>, <diedIn>,}\\
\multicolumn{5}{l}{<hasGender>, <holdsPoliticalPosition>,}\\
\multicolumn{5}{l}{<diedOnDate>, <livesIn>, <wasBornOnDate>,}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{<graduatedFrom> ?}\\
\multicolumn{5}{l}{In the YAGO taxonomy, the class organization}\\
\multicolumn{5}{l}{has 278 subclasses that correspond to 278 different}\\
\multicolumn{5}{l}{types of organization. As with persons, they don't all}\\
\multicolumn{5}{l}{interest us. Here are some examples of organization}\\
\multicolumn{5}{l}{types that we will certainly integrate: academy,}\\
\multicolumn{2}{l}{church\textunderscore school,}\tabcellsep \multicolumn{2}{l}{diplomatic\textunderscore mission,}\tabcellsep deputation,\\
\multicolumn{5}{l}{educational institute, family, industry, institution, local.}\end{longtable} \par
 
\caption{\label{tab_1}}\end{figure}
 		 		\backmatter  			 
\subsection[{Conflicts of Interest}]{Conflicts of Interest}\par
The authors declare no conflicts of interest regarding the publication of this paper.			 			  				\begin{bibitemlist}{1}
\bibitem[Russel and Norwig ()]{b0}\label{b0} 	 		\textit{Artificial Intelligence, a modern approach},  		 			Stuart Russel 		,  		 			Peter Norwig 		.  		2010.  	 	 (Edition Stuart) 
\bibitem[Nico ()]{b5}\label{b5} 	 		\textit{Construction of Engineering Ontologies for Knowledge Sharing and Reuse},  		 			Willem Nico 		,  		 			Borst 		.  		1997.  		 			University of Twente 		 	 
\bibitem[Copeland et al. ()]{b1}\label{b1} 	 		 			B Jack Copeland 		,  		 			Carl J Posy 		,  		 			O Shagrir 		.  		\textit{Computability Turing,Gödel, Church and Beyond},  		2015. The MIT Press.  	 
\bibitem[Hoffart et al. ()]{b7}\label{b7} 	 		 			Johannes Hoffart 		,  		 			Fabian M Suchanek 		,  		 			Klaus Berberich 		,  		 			Gerhard Weikum 		.  		\textit{YAGO2: A Spatially and Temporally Enhanced Knowledge Base from Wikipedia},  		2012.  	 
\bibitem[Smelser and Baltes ()]{b3}\label{b3} 	 		 			N J Smelser 		,  		 			P B Baltes 		.  		\textit{International Encyclopedia of Social and Behavioral Sciences},  		2001.  	 
\bibitem[Manegold et al. (2012)]{b2}\label{b2} 	 		\textit{Special theme Big Data (2012) ERCIM News N°89},  		 			Stefan Manegold 		,  		 			Martin Kersten 		,  		 			Constantino Thanos 		.  		April 2012.  	 
\bibitem[Witten et al. ()]{b6}\label{b6} 	 		 			Ian H Witten 		,  		 			Elbe Frank 		,  		 			Mark A Hall 		.  		\textit{Data mining. Practical Machine Learning Tools and Techniques},  		2011. Morgan Kaufmann Third Edition.  	 
\bibitem[Yimithirr ()]{b4}\label{b4} 	 		 			Guugu Yimithirr 		.  		 \url{https://www.naturalnavigator.com/news/2010/09/guugu-yimithirr}  		\textit{The Natural Navigator},  		2010.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
