<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>ULiS: An Expert System on Linguistics to Support Multilingual Management of Interlingual Semantic Web Knowledge bases</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maxime Lefrançois</string-name>
          <email>Maxime.Lefrancois@inria.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabien Gandon</string-name>
          <email>Fabien.Gandon@inria.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>EPI Edelweiss - INRIA Sophia Antipolis 2004 rt des Lucioles</institution>
          ,
          <addr-line>BP93, Sophia Antipolis, 06902</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <fpage>50</fpage>
      <lpage>61</lpage>
      <abstract>
        <p>We are interested in bridging the world of natural language and the world of the semantic web in particular to support multilingual access to the web of data. In this paper we introduce the ULiS project, that aims at designing a pivot-based NLP technique called Universal Linguistic System, 100% using the semantic web formalisms, and being compliant with the Meaning-Text theory. Through the ULiS, a user could interact with an interlingual knowledge base (IKB) in controlled natural language. Linguistic resources themselves are part of a specific IKB: The Universal Lexical Knowledge base (ULK), so that actors may enhance their controlled natural language, through requests in controlled natural language. We describe a basic interaction scenario at the system level, and provide an overview of the architecture of ULiS. We then introduce the core of the ULiS: the interlingual lexical ontology (ILexicOn), in which each interlingual lexical unit class (ILUc) supports the projection of its semantic decomposition on itself. We validate our model with a standalone ILexicOn, and introduce and explain a concise human-readable notation for it.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>Semantic Web</kwd>
        <kwd>Explanatory Combinatorial Lexicology</kwd>
        <kwd>Interlingual Lexical Ontology</kwd>
        <kwd>Semantic decomposition</kwd>
        <kwd>Interlingual Lexical Primitives</kwd>
        <kwd>Meaning Text Theory</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In this paper we introduce and illustrate the recently begun ULiS project, which aims
at redesigning a pivot-based NLP technique, 100% using the semantic web
formalisms, and being compliant with the Meaning-Text theory. ULiS stands for Universal
Linguistic System, and is a system through which multiple actors could interact with
interlingual semantic web knowledge bases in multiple controlled (i.e., restricted and
formal) natural languages. Each controlled natural language (dictionary, grammar
rules) would be described in a part of a universal linguistic knowledge base (ULK).
Besides this, the ULK consists in one specific interlingual knowledge base. Actors
could then enhance their controlled natural language through different actions in
controlled natural language (e.g., create, describe, modify, merge, or delete lexical units
in the dictionaries and grammar rules; connect situational lexical units to interlingual
lexical units; add linguistic attributes with their associated rules, etc.).</p>
      <p>The aim of this paper is to overview our proposal for the architecture of ULiS, and
to introduce and validate the cornerstone of the universal linguistic knowledge base:
the interlingual lexical ontology (ILexicOn).
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        The Meaning-Text Theory (MTT). The MTT is a theoretical linguistic framework
for the construction of models of natural language. As such, its goal is to write
systems of explicit rules that express the correspondence between meanings and texts (or
sounds) in various languages
        <xref ref-type="bibr" rid="ref6">(Kahane, 2003)</xref>
        . Seven different levels of linguistic
representation are supposed for each set of synonymous utterances: a semantic
representation that is a network; the deep and surface syntactic representations (DSynR and
SSynR) that are trees; the deep and surface morphological representations (DMorphR
and SMorphR) that are lists of annotated tokens; and the the deep and surface
phonological representations (DPhonR and SPhonR) that are also lists of annotated tokens.
        <xref ref-type="bibr" rid="ref10">(Mel'čuk, 1998)</xref>
        .
      </p>
      <p>
        Thus, twelve modules containing transformation rules are used to transcribe
representations of a level into representations of an adjacent level. The main constituent of
the MTT is the dictionary model where lexical units are described, which is called the
Explanatory Combinatorial Dictionary (ECD), and has been the object of many
works on lexical functions, e.g.,
        <xref ref-type="bibr" rid="ref9">(Mel'čuk et. al., 1995)</xref>
        .
      </p>
      <p>
        Lexical ontologies and meaning representation languages. Lexical ontologies are
ontologies of lexicalized concepts, widely used to model lexical semantics. Some
have broad coverage but shallow treatment (i.e., with no or little axiomatization) such
as Princeton WordNet
        <xref ref-type="bibr" rid="ref12">(e.g., Miller et al., 1990)</xref>
        , and some have small coverage but
are highly axiomatized such as FrameNet
        <xref ref-type="bibr" rid="ref1">(Baker et al. 1998)</xref>
        . They use different
theories of lexical semantics but most of them do not describe phrasemes nor lexical
collocations. The French Lexical Network
        <xref ref-type="bibr" rid="ref8">(Lux-Pogodalla &amp; Polguère, 2011)</xref>
        is a
growing ECD-compliant lexical resource, but it does not use the semantic web formalisms,
and the definitions of the lexical units are not fully formalized.
      </p>
      <p>
        On the other hand, the Universal Networking Language (UNL) is a meaning
representation language, originally designed for pivot techniques Machine Translation. Its
dictionary is an interlingual lexical ontology based on so-called Universal Words ++,
but the lack of argument frames and lexical functions in the UNL dictionary was
pointed out in (Bogulsavsky, 2002; Bogulsavsky, 2005). This is when the idea of an
ECD-compliant interlingual lexical ontology was first mentioned. After the semantic
web formalisms were introduced at the W3C, an attempt to port the UNL to semantic
web formalisms was the topic of the W3C Common Web Language Incubator Group
        <xref ref-type="bibr" rid="ref15">(XGR-CWL, 2008)</xref>
        , but no improvement was made to the lexical ontology.
SPARQL Inferencing Notation (SPIN). Grammar rules are not part of the Common
Web Language (CWL) framework, in fact, the construction of grammar modules may
be done in any programming language. Knublauch et. al. (2011) introduced SPIN: an
RDFS schema to represent SPARQL rules and constraints.
      </p>
      <p>Positioning of the ULiS project. The lexical resource we propose to develop is an
interlingual lexical ontology coupled with a situational (i.e., a generalization of
language-specific) lexical ontology, both using semantic web formalisms, and that
together form an ECD-compliant dictionary. Benefits of using semantic web formalisms
are high as it enables us to construct an axiomatized graph-representation of a lexical
ontology, with validation and inference rules. Using SPIN, we propose to include
transformation rules directly in an RDF format, on top of the ECD-compliant lexical
ontologies, thus obtaining an expert system on linguistics.</p>
      <p>
        The ULiS model is somehow similar to the FunGramKB
        <xref ref-type="bibr" rid="ref13">(Periñán-Pascual &amp;
Arcas-Túnez, 2010)</xref>
        which is a lexico-conceptual knowledge base for NLP. However,
the two projects have different inspiring influence. We choose to comply with the
Meaning-Text theory, which gives a thorough understanding of lexical functions that
are ubiquitous in every natural language. We also choose to describe the whole ULiS
with the semantic web formalisms. This thus potentially enables the enhancement of
the system itself through controlled natural language interactions.
3
      </p>
      <p>Basic Interaction Scenarios with the ULiS
The three basic scenarios of ULiS are illustrated on Figure 1 below.</p>
      <p>An actor in a situation c inputs some utterance (e.g., in English: "Who killed
Mary?") that is first transformed into an RDF situational representation, which
undergoes different language-specific process, and which is finally transformed into a
CWL-like interlingual representation.</p>
      <p>Machine translation. At this stage, depending on the context, the interlingual
representation of the utterance may be translated into another utterance in situation d (e.g.,
in the French situation: "Qui a tué Mary?") through a situational representation
(Output1TEXT on Figure 1.</p>
      <p>Management of Interlingual Knowledge Bases. Another possibility is that the
interlingual representation of the utterance is transformed in a SPARQL request that is
applied on an interlingual knowledge base (IKB), which eventually produces an RDF
output (e.g., ex:John01). This RDF output is then first transformed into an
interlingual representation, then into a situational representation and finally into an output
utterance: Output2TEXT on Figure 1 (e.g., "John killed Mary").</p>
      <p>Management of the Universal Linguistic Knowledge base. Finally, the third
scenario is the human-computing scenario: the SPARQL request is applied on the
Universal Linguistic Knowledge base, which is the Interlingual Knowledge Base where the
The RDF-World
RDF interlingual
representations
RDF situational
representations</p>
      <p>IR RDF
SRc RDF</p>
      <p>SRd RDF
whole ULiS is described. Human actors may thus enhance the controlled natural
languages through actions stated in controlled natural language.</p>
      <p>SPARQL
Request</p>
      <p>SPARQLRDF + X RDF</p>
      <p>IKBRDF</p>
      <p>RDF</p>
      <p>Output
X RDF
IR RDF
SRd RDF</p>
      <sec id="sec-2-1">
        <title>InputTEXT</title>
      </sec>
      <sec id="sec-2-2">
        <title>Output1TEXT</title>
      </sec>
      <sec id="sec-2-3">
        <title>Output2TEXT</title>
        <p>Thus the interlingual representation format acts as a pivot not only for natural
languages, but any interlingual representation may be translated into a SPARQL request,
and any RDF graph may be translated to an interlingual representation.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>The ULiS components</title>
      <sec id="sec-3-1">
        <title>ILexiMOn</title>
        <p>« Interlingual</p>
        <p>Lexical</p>
        <p>Meta-Ontology »
ileximon:ILexicalUnit</p>
      </sec>
      <sec id="sec-3-2">
        <title>SLexiMOn</title>
        <p>« Situational</p>
        <p>Lexical</p>
        <p>Meta-Ontology »
sleximon:SLexicalUnit
InterlingualKnowledgeBase</p>
        <p>IKB = KB + anchors + transformation rules
(ikb:kill,rdfs:range,ikb:Person)
(ikb:kill,rdfs:domain,ikb:Person)</p>
      </sec>
      <sec id="sec-3-3">
        <title>ILexicOn</title>
        <p>pure interlingual features of the ECD
ilexicon:Person</p>
      </sec>
      <sec id="sec-3-4">
        <title>SLexicOn</title>
        <p>englishlexicon:Person
espanollexicon:Persona
francaislexicon:Personne
Other features of the ECD + Links
+ Transformation rules
(ex:John01,ikb:kill,ex:Mary01)</p>
        <p>IRs RDF
ex:John01</p>
        <p>DSynRs
SSynRs
DMorphRs
SMorphRs
DPhonRs</p>
        <p>SPhonRs
SRs RDF
The meta-ontology. The interlingual lexical meta-ontology (ILexiMOn) is the
schema that the ILexicOn must satisfy to be compliant with the pure semantic features of
the Explanatory Combinatorial Dictionary (ECD). It defines meta-classes, uses RDFS
and some of OWL full's axioms, and contains ad hoc SPIN validation and inference
rules for the ILexicOn and the interlingual semantic representations (ISemRs).
The ontology. The interlingual lexical ontology (ILexicOn) is the interlingual
dictionary where interlingual lexical unit classes (ILUcs) are formally defined as instances
of the ILexicalUnit meta-class from the ILexiMOn. The ILexicOn contains all the
pure semantic features of the Explanatory Combinatorial Dictionary (ECD). Any
concept expressible in a natural language or a jargon is defined in the ILexicOn that
contains:
• The formal definitions of the ILUcs (described in section 5.2)
• The definitions of interlingual attribute classes (IAtts) (e.g., plural, future, 1st
person, indefinite, etc.);
• The definitions of the interlingual semantic relations (ISemRels), that are used in
the formal definitions of the ILUcs and to construct interlingual semantic
representations (ISemRs);
• Interlingual lexical functions: every purely-semantic lexical links such as
synonymy, and purely-semantic generic constructions such as the lexical function
Centr(X), i.e., (the center of X), or Fin(X), i.e., (stop being X .
)
The interlingual semantic representations. ISemRs are RDF graphs with nodes
being interlingual lexical unit instances (ILUis), and arcs being ISemRels. ILUis may
also be instances of IAtts. Arcs are interlingual semantic relations (ISemRels).
4.3</p>
        <p>To and from Natural Language facts
Situations. Interlingual-based lexical resources consider connecting language specific
dictionaries to some interlingual dictionary. We generalize this by using situations
(i.e., the situations of understanding and use of some linguistic element).</p>
        <p>The situation of a linguistic element is part of the pragmatics of its use: it
represents not only the language used (e.g., EN, FR), but also sociolectal marks (e.g.,
biologists, architects, official, slang, reverential), topolectal marks (e.g., U.S.,
Canada), chronolectal marks (e.g., old, neologic), and even individual marks (e.g., a
particular group of people). The intersection of situations is also a situation
(EN-U.S.slang), and so is the union of situations (FR-Canada OR FR-France-old).
Architecture of the situational layer. This architecture purposefully mirrors the
interlingual layer:</p>
        <p>A situational lexical meta-ontology (SLexiMOn) describes the SLexicOn,
A situational lexical ontology (SLexicOn), contains all non-purely semantic
features of the ECD. A non-exhaustive list is the following:
• Definitions of situational lexical unit classes, called SLUcs, by means of a link to
an ILUc, which is annotated by a specific situation.
• Situational lexical functions such as Instr(X), i.e., the preposition that governs the
keyword X and means: (by means of).
• Situational attribute classes (e.g., invariable English nouns, French 1st verb group,</p>
        <p>German dative, etc.), their associated situations and rules.
• Situational relations: relations that link two instances of the SLUcs, thus defining
the dependency syntax of the utterance, or the order of the words in an utterance.</p>
        <p>Situational representations (SRs). The data consist of situational representations
(SRs): RDF graphs having situational lexical unit instances (SLUis) as nodes and
situational relations as arcs. A SR thus represents the different representations of the
Meaning-Text theory.</p>
        <p>Transformation rules. Contrary to the Common Web Language (CWL), where no
grammar rules representation is proposed, we plan to introduce transformation rules
in the SLexiMOn. Transformation rules form a subclass of the SPIN rules and are
attached to a SLUc to define a correspondence between a generic pattern from a
representation level, to another pattern at a deeper or to a higher representation level. Thus,
each situation may define its own analysis and production grammar, both made of six
sets of transformation rules.</p>
        <p>
          Transformation rules may be sorted according to their level of genericity:
transformation rules that are attached to ISemRels, or to IAtts, are less specific than rules
that may be triggered only when a complex ISemR patterns is met; also, rules that
may be triggered in generic situations are less specific than those that may only be
triggered in more specific situations. The important point is that a rule must be
triggered if and only if there is not a more specific rule that can be triggered instead. This
implies that an algorithm different from the simple forward-chaining algorithm must
be proposed. It will be very important to optimize the application of such an algorithm
with a whole set of rules. We therefore plan to construct a Rete network
          <xref ref-type="bibr" rid="ref5">(Forgy, 1982)</xref>
          on top of each set of transformation rules, which is eased by the SPIN framework as
each rule is modeled as an RDF graph.
        </p>
        <p>Finally, a set of generic transformation rules must be designed to ensure that for
each situation, every SR is transformable to an ISemR, and that every ISemR is
transformable to a SR. When a new situation is introduced (e.g., a new language), this
criterion is a priori not met. This is the reason why we suggest the introduction of the
universal situation, and transformation rules that produce Notation3-like output. We
claim that a small set of rules will suffice to produce and analyze simple controlled
natural languages.
4.4</p>
        <p>To and from Interlingual Knowledge Bases facts.</p>
        <p>Interlingual knowledge bases. The main criterion that an interlingual knowledge
base must meet is that any RDF graph inside it must be transformable into an
interlingual semantic representation (ISemR). We thus propose to form interlingual
knowledge bases by augmenting classic knowledge bases with anchors and transformation
rules:
• An anchor is a triple that links an RDF resource to an ILUc. For instance, the RDF
resource rdfs:Class will be anchored to a specific ILUc ilexicon:RdfClass
that formally defines the concept of an RDF class, and that is itself linked to an
English SLUc that is a pluralizable noun realized by the string "class";
• The transformation rules are stored in the interlingual knowledge base and form
two separated sets of rules: one for producing RDF from an ISemR, the other for
producing an ISemR from RDF. Here again, transformation rules may be sorted
according to their level of genericity, and the most generic rules must be inhibited
when more specific ones can be triggered.</p>
        <p>Augmenting classic semantic web formalisms. The output of an ISemR must be a
valid SPARQL request, and the output of any RDF graph must be a valid ISemR. This
criterion will be satisfied by the introduction of different anchors and generic
transformation rules in the classic semantic web vocabularies: RDF, then RDFS, OWL and
SPIN, and finally SKOS. Thus an RDF class that has no anchor, e.g., foaf:Person,
has a correspondence with an ISemR that itself has a correspondence to the textual
representation for the EN situation: "The RDF class foaf:Person".
5
5.1</p>
        <p>Modeling Choices in the Interlingual Layer
Overview
owl:Class
owl:ObjectProperty
xsd:boolean
owl:intersectionOf is-a
owl:unionOf
owl:propertyChainAxiom
owl:hasSelf
subClassOf</p>
        <p>is-a
:ILexicalUnit
is-a
subClassOf
:ILexicalPrimitive
:Entity
:Person
:Mary01
hasEntity
is-a
:State
:Alive
:Alive01</p>
        <p>subClassOf is-a
:ISemanticRelation
intersectionOf
:onISemanticRelation
:allValuesFrom
:isObligatory range
:hasEntity</p>
        <p>true
Class/instance</p>
        <p>A B
A is a subClass of B</p>
        <p>B
A</p>
        <p>C
A is the intersection
of B and C
property
A</p>
        <p>B
A is an instance of B</p>
        <p>p
A B
A is linked to B
through property p</p>
        <p>RDF/XML document available at URL: http://ns.inria.fr/ulk/2011/06/10/ileximon-core
RDF/XML document available at URL: http://ns.inria.fr/ulk/2011/06/10/ilexicon-ex
RDF/XML document available at URL: http://ns.inria.fr/ulk/2011/06/10/sems-ex
From top to bottom: 1) the semantic web formalisms, with a few OWL classes and
properties that are useful for our work; 2) the detailed core-ILexiMOn; 3) an overview
of the light standalone ILexicOn; and 4) an overview of data from the interlingual
data component. Notice that: i) ILUis from the data are instances of ILUcs described
in the ILexicOn, that are themselves instances of the ILexicalUnit meta-classes
described in the ILexiMOn; and ii) properties used to link two resources in a layer are
described in an upper layer.</p>
        <p>ILexicOn – standalone&amp;light</p>
        <p>State –(hasEntity)→1.Entity
Relation&lt;State –(hasEntity)→1.Entity</p>
        <p>–(hasObject)→1.Entity
Event –(hasTime)→1.Time
Cause&lt;Event –(hasTime)→1.Time
–(hasAgent)→1.Person
–(hasEvent)→1.Event</p>
        <p>Entity
Person&lt;Entity</p>
        <p>Time&lt;Entity
Alive&lt;State –(hasEntity)→1.Person
Parent&lt;Relation –(hasEntity)→1.Person</p>
        <p>–(hasObject)→1.Person
End&lt;Event –(hasTime)→1.Time</p>
        <p>–(hasState)→1.State
Die&lt;End –(hasTime)→1.Time
–(hasState)→1.Alive –(hasEntity)1.Person
–(hasState/hasEntity&lt;hasDead)→1.Person
Kill&lt;Cause –(hasTime)→1.Time
–(hasAgent)→1.Person
–(hasEvent)→1.Die –(hasTime)→1.Time</p>
        <p>–(hasDead)→1.Person
–(hasEvent/hasDead&lt;hasKilled)→1.Person
–(hasEvent/hasTime&lt;hasKillTime&lt;hasTime)→1.Time
–(hasBeneficiary)→?.Person</p>
        <p>Suicide&lt;Kill –(hasKillTime)→1.Time
–(hasBeneficiary)→?.Person
–(hasAgent)→1.Person
–(hasKilled)→1.Person
–(hasExperiencer&lt;hasAgent, hasKilled)→1.Person
Infanticide&lt;Kill –(hasKillTime)→1.Time
–(hasBeneficiary)→?.Person
–(hasAgent)→1.Person
–(hasKilled)→1.Person
– (hasParent)→1.Parent –(hasEntity)→1.Person</p>
        <p>–(hasObject)→1.Person
–(hasParent/hasObject&lt;hasKillerParent&lt;hasAgent)→1.Person
–(hasParent/hasEntity&lt;hasKilledChild&lt;hasKilled)→1.Person
ISemR</p>
        <p>John kills Mary: Kill: k01 –(hasAgent)→Person: John01</p>
        <p>–(hasKilled)→Person: Mary01
definition of the ILUc that is written in its top-left corner.
5.2</p>
        <p>
          The lexicographic definition of lexical units
In the ILexicOn is propose a novel approach to the lexicographic definition of an
ILUc that consists in projecting the minimal semantic decomposition of the ILUc on
the ILUc using Conceptual Participant slots (ConP-slot): the implicit semantic link
that exists between an ILUc L and one of the participants of the minimal semantic
decomposition of L
          <xref ref-type="bibr" rid="ref11 ref7">(Mel'čuk, 2004 ; Lefrançois &amp; Gandon, 2011)</xref>
          .
        </p>
        <p>Interlingual lexical units (classes and instances): ILUcs are instances of the
ILexicalUnit meta-class from the ILexiMOn (c.f., Figure 3). They are defined in the
ILexicOn (c.f., Figure 4, e.g., Entity, Person, State, Alive, Event, Cause). In our notation,
symbol &lt; represents the rdfs:subClassOf axiom that may be used to state inheritance
between ILUcs (e.g., Person&lt;Entity, Alive&lt;State, Cause&lt;Event). For instance, The
ILUc Person is a sub-class of the ILUc class Entity, and the ILUc Entity is the parent
of the ILUc Person. Complex ILUcs may be constructed through owl:intersectionOf
and owl:unionOf. Finally, interlingual lexical unit instances (ILUis) are instances of
ILUcs and are used in the data component as nodes of the interlingual semantic
representations.</p>
        <p>Interlingual semantic relations: ISemRels are instances of the ISemRelation
metaclass of the ILexiMOn, and thus instances of owl:ObjectProperties. They are
introduced in the LexicOn and used in the data to link ILUis (see Figure 3&amp;4). In our
notation, symbol &lt; represents the rdfs:subPropertyOf axiom that may be used to define a
new ISemRel as being a sub-ISemRel of one or more ISemRels (e.g.,
hasExperiencer&lt;hasAgent, hasKilled). Symbol / represents the owl:propertyChainAxiom axiom
that may also be used to state that a ISemRel is a super-ISemRel of the composition
of two or more ISemRels (e.g., hasState/hasEntity&lt;hasDead). These two axioms may
be combined to define complex ISemRels (e.g.,
hasEvent/hasTime&lt;hasKillTime&lt;hasTime).</p>
        <p>Interlingual lexical primitives: An ILUc L is a ILPc if and only if it derives from no
other ILUc but has at least one ConP-slot. Non- lexical primitives then derive from
one or more lexical primitives following the ConP-slot inheritance and introduction
principle:</p>
        <p>An ILUc L inherits from its parents' ConP-slots, and may also introduce new
ConP-slots;
One may thus consider only participants that are necessary and sufficient to the
minimal projection of L. ILPcs are defined as instances of the ILexicalPrimitive
metaclass from the ILexiMOn (c.f., Figure 3). An ILPc must be linked through: i) the
onISemanticRelation property to exactly one ISemanticRelation; ii) the allValuesFrom
property to exactly one ILexicalUnit; and iii) the isObligatory property to exactly one
xsd:boolean.</p>
        <p>Conceptual participant slots: In Figure 4, each line with an arrow in the definition
of an ILUc represents a conceptual participant slot (ConP-slot) that restricts the use of
a specific ISemRel for this ILUc and its descendants. Actually, such a line means that
the defined ILUc is a sub-class of an ILPc. For instance, the line State–
(hasEntity)→1.Entity states that any instance of the State class is linked exactly once
through the hasEntity relation to an instance of the Entity class. Let us focus on the
notation used on Figure 4:
• Inheritance. ConP-slots may be newly defined (black font, e.g.,
State–(hasEntity)→1.Entity), fully inherited (grey font, e.g.,
Relation&lt;State–(hasEntity)→1.Entity) or partially inherited (grey font for the
inherited part, e.g., Alive&lt;State–(hasEntity)→1.Person). The ILUc on the right hand
side of the line is called the current range of the ConP-slot.
• Obligatory vs. optional. A ConP-slot may be obligatory (symbol 1, e.g.,
Alive&lt;State–(hasEntity)→1.Person) or optional (symbol ?, e.g., Kill&lt;Cause–
(hasBeneficiary)→?.Person). When an optional ConP-slot is inherited, it may be
restricted to being obligatory.
• Domain/range of the ISemRel. As an ISemRel is an rdf:Property, it may restrict
its domain and its range i.e., what ILUc the subject (resp. the object) of a triple that
involves this ISemRel does belong to. When an ISemRel is underlined, it means
that its domain is set to the defined ILUc, and that its range is set to the current
ILUc range of the ConP-slot. (e.g., State–(hasEntity)→1.Entity).
• ISemRel subproperty and composition axioms. As we stated in section 4.2.2,
complex ISemRel may be defined thanks to inheritance and composition. There are
benefits in using such ISemRel to qualify a new ConP-slot. In fact, this combined
with the maximum cardinality of ConP-slots restricted to 1, imposes the equality of
ILUi in the data. We illustrate these inferable equalities by dotted lines on the right
of ConP-slots.</p>
        <p>The ISemRel inheritance and composition is what enables the projection not only of
trees, but also graphs, onto one node. Thus, each ILUc described in the ILexicOn
contains the projection of its semantic decomposition graph. We illustrated this on Figure
4 with complex ILUc such as ilexicon:Suicide (the killer is the person killed) and
ilexicon:Infanticide (the killer is the parent of the person killed).
6</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and discussions</title>
      <p>We introduced a universal linguistic system (ULiS) through which multiple actors
could interact with an interlingual knowledge base (IKB) in controlled natural
language. We explained an interaction scenario with ULiS, which can serve for machine
translation and for multilingual management of interlingual knowledge bases. We
then gave an overview of the layers ULiS is made of: the interlingual layer; the
situational layer; and an interlingual knowledge base.</p>
      <p>The main novelty of our proposal is that the characteristics of each controlled
natural language are stored in a specific interlingual knowledge base. Thus, actors could
enhance their controlled natural language through requests expressed in controlled
natural language.</p>
      <p>We introduced and illustrated a novel approach to formally define ILUcs: we make
ILUcs support a projection of their semantic decomposition. We introduced a
humanreadable notation to represent ILexicOn, and we used this notation to validate our
approach with a simple standalone ILexicOn. We thus showed that simple and
comc
plex ILU s may be formally defined with our novel approach.</p>
      <p>We are currently working on the formalization of lexical functions in the ILexicOn
and of the SLexicOn, and we are to partly populate our lexical resources with lexical
units from other lexical resources such as the French Lexical Network. We finally
plan to validate our results by the design and the experimentation of a web-based
prototype with a simple interlingual knowledge base (e.g., the
"interlingualaugmented" wine ontology), and a few situations based on English and French.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baker</surname>
            ,
            <given-names>C.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fillmore</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Lowe</surname>
            ,
            <given-names>J.B.</given-names>
          </string-name>
          :
          <article-title>The berkeley framenet project</article-title>
          .
          <source>In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics-Volume</source>
          <volume>1</volume>
          ,
          <fpage>16</fpage>
          -
          <lpage>90</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Boguslavsky</surname>
            ,
            <given-names>I.:</given-names>
          </string-name>
          <article-title>Some Lexical Issues of UNL</article-title>
          .
          <source>Proceedings of the First International Workshop on UNL, other interlinguas and their applications</source>
          ,
          <source>Las Palmas</source>
          ,
          <fpage>19</fpage>
          -
          <lpage>22</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Boguslavsky</surname>
            ,
            <given-names>I.:</given-names>
          </string-name>
          <article-title>Some controversial issues of UNL: Linguistic aspects</article-title>
          .
          <source>Research on Computer Science</source>
          ,
          <volume>12</volume>
          :
          <fpage>77</fpage>
          -
          <lpage>100</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Blay-Fornarino</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pinna-Dery</surname>
            ,
            <given-names>A.-M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Zaraté</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Cooperative Systems Design: A Challenge of the Mobility Age</article-title>
          .
          <source>In: Proceedings of COOP</source>
          <year>2002</year>
          ,
          <article-title>Saint-</article-title>
          <string-name>
            <surname>Raphaël</surname>
          </string-name>
          , France,
          <fpage>4</fpage>
          -
          <lpage>7</lpage>
          June 2002, IOS Press, pp.
          <fpage>23</fpage>
          -
          <lpage>37</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Forgy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem</article-title>
          .
          <source>In: Artificial Intelligence</source>
          , vol.
          <volume>19</volume>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>37</lpage>
          (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kahane</surname>
            ,
            <given-names>S.: The</given-names>
          </string-name>
          <string-name>
            <surname>Meaning-Text</surname>
            <given-names>Theory</given-names>
          </string-name>
          ,
          <article-title>Dependency and Valency</article-title>
          .
          <source>In: Handbooks of Linguistics and Communication Sciences</source>
          <volume>25</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>2</lpage>
          , Berlin/NY: De Gruyter,
          <volume>32</volume>
          p. (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Lefrançois</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Gandon</surname>
          </string-name>
          , F.:
          <article-title>ILexicOn: toward an ECD-compliant interlingual lexical ontology described with semantic web formalisms</article-title>
          .
          <source>In Proceedings of the 5th MeaningText Theory</source>
          ,
          <source>Barcelona (Spain)</source>
          ,
          <fpage>155</fpage>
          -
          <lpage>164</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lux-Pogodalla</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Polguère</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Construction of a French Lexical Network: Methodological Issues</article-title>
          . International Workshop on Lexical Resources (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mel</surname>
          </string-name>
          <article-title>'čuk, I.A</article-title>
          .,
          <string-name>
            <surname>Clas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Polguère</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Introduction à la lexicologie explicative et combinatoire (</article-title>
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Mel</surname>
          </string-name>
          <article-title>'čuk, I.A.: The Meaning-Text Approach to the Study of Natural Language and Linguistic Functional Models</article-title>
          .
          <source>[Invited lecture.] In S. Embleton (ed.): LACUS Forum 24</source>
          ,
          <string-name>
            <surname>Chapel</surname>
            <given-names>Hill</given-names>
          </string-name>
          : LACUS, pp.
          <fpage>3</fpage>
          -
          <lpage>20</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Mel</surname>
          </string-name>
          <article-title>'čuk, I.A.: Actants in semantics and syntax I: Actants in semantics</article-title>
          .
          <source>Linguistics</source>
          .
          <volume>42</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>66</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>G.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beckwith</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fellbaum</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gross</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Introduction to wordnet: An on-line lexical database</article-title>
          .
          <source>Int. Journal of lexicography</source>
          ,
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <fpage>235</fpage>
          -
          <lpage>344</lpage>
          (
          <year>1990</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>Periñán</given-names>
            <surname>Pascual</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            and
            <surname>Arcas Túnez</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>The architecture of FunGramKB</article-title>
          .
          <source>In Proceedings of the Seventh International Conference on Language Resources and Evaluation</source>
          ,
          <source>Valeta (Malta)</source>
          ,
          <fpage>2667</fpage>
          -
          <lpage>2674</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Sowa</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Conceptual structures: information processing in mind and machine, System programming series</article-title>
          , Addison-Wesley (
          <year>1984</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>XGR-CWL</surname>
          </string-name>
          :
          <article-title>Report of W3C Incubator Group on Common Web Language</article-title>
          , http://www.w3.org/2005/Incubator/cwl/XGR-cwl-
          <volume>20080331</volume>
          / (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>