CREATING AND QUERYING FORMAL ONTOLOGIES VIA CONTROLLED NATURAL LANGUAGE

Formal ontologies are difficult to read and understand for domain experts who do not have a background in formal logic. This severely restricts the ability of this user group to determine whether an ontology conforms to the requirements of the application domain or not. We argue that a formal ontolo...

Full description

Saved in:
Bibliographic Details
Published inApplied artificial intelligence Vol. 24; no. 1-2; pp. 149 - 174
Main Author Schwitter, Rolf
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis Group 01.01.2010
Taylor & Francis Ltd
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Formal ontologies are difficult to read and understand for domain experts who do not have a background in formal logic. This severely restricts the ability of this user group to determine whether an ontology conforms to the requirements of the application domain or not. We argue that a formal ontology-in our case a description logic knowledge base-should be created in a linguistically motivated way so that domain experts can understand and query the ontology. We first show that this can be partially achieved with the help of a naming convention which is based on those linguistic expressions that occur in the application domain. We then go a step further and suggest the use of a controlled natural language for creating and querying formal ontologies that follows the syntactic structure of a well-defined subset of English.
AbstractList Formal ontologies are difficult to read and understand for domain experts who do not have a background in formal logic. This severely restricts the ability of this user group to determine whether an ontology conforms to the requirements of the application domain or not. We argue that a formal ontology - in our case a description logic knowledge base - should be created in a linguistically motivated way so that domain experts can understand and query the ontology. We first show that this can be partially achieved with the help of a naming convention which is based on those linguistic expressions that occur in the application domain. We then go a step further and suggest the use of a controlled natural language for creating and querying formal ontologies that follows the syntactic structure of a well-defined subset of English. [PUBLICATION ABSTRACT]
Formal ontologies are difficult to read and understand for domain experts who do not have a background in formal logic. This severely restricts the ability of this user group to determine whether an ontology conforms to the requirements of the application domain or not. We argue that a formal ontology-in our case a description logic knowledge base-should be created in a linguistically motivated way so that domain experts can understand and query the ontology. We first show that this can be partially achieved with the help of a naming convention which is based on those linguistic expressions that occur in the application domain. We then go a step further and suggest the use of a controlled natural language for creating and querying formal ontologies that follows the syntactic structure of a well-defined subset of English.
Author Schwitter, Rolf
Author_xml – sequence: 1
  givenname: Rolf
  surname: Schwitter
  fullname: Schwitter, Rolf
  email: Rolf.Schwitter@mq.edu.au
  organization: Centre for Language Technology, Macquarie University
BookMark eNqFkE9L9DAQh4MouP75AN6KF0_1nTRJkwUvZa19F_q2WHcFTyHbTaDSbTTpon57s-hJ8fU0_JjnmRnmCO0PdtAInWG4xCDgDwhBpgzDFAilggPsoUlo8DhllO2jya4fB4AeoiPvHwEAc44nqJg1ebaYV0WUVdfR7TJvHnbhpm7-ZWVUV4u6rIt5fhfdz7NoFnJTl2V-HVXZYtkEosyqYpkV-Qk6MKr3-vSzHqPlTb6Y_Y13-iwr45YCG2O8okAZTQ1LDUnMGhgmSq2SKSYAUw2acKBUYaXXSpgVE1SnWIBRmrZUJC05Rhcfc5-cfd5qP8pN51vd92rQduslpyRlnHIcyPMv5KPduiEcJxPMRJoAEwHiH1DrrPdOG9l2oxo7O4xOdb3EIHfvld_eG0z8xXxy3Ua5t_86n9u6wVi3US_W9Ws5qrfeOuPU0Hb-uyXH1zGYV7-a5OfF79Pbmqo
CitedBy_id crossref_primary_10_1111_j_1467_8640_2011_00382_x
crossref_primary_10_1007_s10846_012_9779_1
crossref_primary_10_1016_j_is_2015_04_003
Cites_doi 10.1017/S135132490000005X
10.1007/978-3-642-03754-2_1
10.1109/MIC.2007.124
10.1007/s10579-007-9048-2
10.1007/11814771_26
10.1016/j.websem.2003.07.001
10.1007/11762256_30
10.1023/A:1005806324129
10.1006/knac.1993.1008
10.3115/1220355.1220376
10.1145/581344.581347
10.1007/11926078_78
10.1109/MIC.2005.135
10.1007/11574620_11
10.1109/SKG.2007.147
10.1016/j.websem.2007.03.004
10.1017/S0269888900005476
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2010
Copyright Taylor & Francis Ltd. 2010
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2010
– notice: Copyright Taylor & Francis Ltd. 2010
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1080/08839510903448700
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Computer and Information Systems Abstracts
Technology Research Database

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1087-6545
EndPage 174
ExternalDocumentID 1957292921
10_1080_08839510903448700
445231
Genre Feature
GroupedDBID .4S
.7F
.DC
.QJ
0YH
23M
2DF
30N
4.4
5GY
5VS
8VB
AAENE
AAJMT
ABCCY
ABDBF
ABFIM
ABHAV
ABIVO
ABPEM
ABTAI
ACGEJ
ACGFS
ACGOD
ACNCT
ACTIO
ACUHS
ADCVX
ADXPE
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AGMYJ
AHQJS
AIJEM
AJWEG
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
ARCSS
AVBZW
AWYRJ
BLEHA
CAG
CCCUG
CE4
COF
CS3
DGEBU
DKSSO
EAP
EBR
EBS
EBU
ECS
EDO
EJD
EMK
EPL
EST
ESX
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
M4Z
MK~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
S-T
SNACF
TFL
TFT
TFW
TH9
TNC
TTHFI
TUS
TWF
UT5
UU3
ZL0
~S~
AAFWJ
AAYXX
ADMLS
AIYEW
CITATION
TDBHL
7SC
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c405t-1b404546f56f32fd0513aab2913009e0e37044a1aeda8fb584e6180fae4c482c3
ISSN 0883-9514
IngestDate Thu Jul 10 23:36:33 EDT 2025
Mon Jun 30 16:43:13 EDT 2025
Tue Jul 01 02:03:58 EDT 2025
Thu Apr 24 22:53:53 EDT 2025
Mon May 13 12:10:48 EDT 2019
Wed Dec 25 09:02:03 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1-2
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c405t-1b404546f56f32fd0513aab2913009e0e37044a1aeda8fb584e6180fae4c482c3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 215862058
PQPubID 53050
PageCount 26
ParticipantIDs informaworld_taylorfrancis_310_1080_08839510903448700
crossref_citationtrail_10_1080_08839510903448700
crossref_primary_10_1080_08839510903448700
proquest_journals_215862058
proquest_miscellaneous_743657471
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2010-01-01
PublicationDateYYYYMMDD 2010-01-01
PublicationDate_xml – month: 01
  year: 2010
  text: 2010-01-01
  day: 01
PublicationDecade 2010
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Applied artificial intelligence
PublicationYear 2010
Publisher Taylor & Francis Group
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis Group
– name: Taylor & Francis Ltd
References CIT0030
Chintaphally V. R. (CIT0007) 2007
CIT0032
CIT0031
CIT0012
Schwitter R. (CIT0034) 2004
CIT0011
Androutsopoulos I. (CIT0001) 1995; 1
Sirin E. (CIT0037) 2007; 5
Baader F. (CIT0002) 2003
CIT0014
CIT0036
Horrocks I. (CIT0015) 2003; 1
CIT0035
Hart G. (CIT0013) 2007; 258
CIT0016
CIT0038
Kuhn T. (CIT0021) 2008
CIT0018
CIT0017
CIT0039
CIT0019
CIT0041
CIT0040
Gazdar G. (CIT0010) 1989
CIT0020
CIT0042
CIT0023
CIT0022
Schwitter R. (CIT0033) 2003
CIT0003
CIT0025
CIT0024
CIT0005
CIT0027
CIT0004
CIT0026
Cregan A. (CIT0009) 2007
CIT0029
CIT0006
CIT0028
CIT0008
References_xml – volume: 1
  start-page: 29
  year: 1995
  ident: CIT0001
  publication-title: Journal of Language Engineering
  doi: 10.1017/S135132490000005X
– ident: CIT0003
  doi: 10.1007/978-3-642-03754-2_1
– volume-title: Proceedings of ALTA 2008
  year: 2008
  ident: CIT0021
– start-page: 82
  year: 2007
  ident: CIT0007
  publication-title: IEEE Internet Computing
  doi: 10.1109/MIC.2007.124
– ident: CIT0019
  doi: 10.1007/s10579-007-9048-2
– ident: CIT0040
  doi: 10.1007/11814771_26
– volume: 1
  start-page: 7
  year: 2003
  ident: CIT0015
  publication-title: Journal of Web Semantics
  doi: 10.1016/j.websem.2003.07.001
– ident: CIT0022
  doi: 10.1007/11762256_30
– volume-title: Natural Language Processing in Prolog. An Introduction to Computational Linguistics.
  year: 1989
  ident: CIT0010
– volume-title: 3rd OWL Experiences and Directions Workshop (OWLED 2007)
  year: 2007
  ident: CIT0009
– ident: CIT0029
– ident: CIT0031
– ident: CIT0025
– ident: CIT0023
– ident: CIT0038
  doi: 10.1023/A:1005806324129
– ident: CIT0004
– ident: CIT0035
– ident: CIT0011
  doi: 10.1006/knac.1993.1008
– ident: CIT0027
  doi: 10.3115/1220355.1220376
– ident: CIT0042
  doi: 10.1145/581344.581347
– ident: CIT0016
– ident: CIT0041
– volume-title: The Description Logic Handbook.
  year: 2003
  ident: CIT0002
– ident: CIT0017
  doi: 10.1007/11926078_78
– ident: CIT0018
– start-page: 55
  volume-title: Australasian Language Technology Workshop
  year: 2004
  ident: CIT0034
– ident: CIT0014
– ident: CIT0020
– ident: CIT0012
– ident: CIT0039
  doi: 10.1109/MIC.2005.135
– ident: CIT0006
  doi: 10.1007/11574620_11
– volume: 258
  volume-title: 3rd OWL Experiences and Directions Workshop (OWLED 2007)
  year: 2007
  ident: CIT0013
– ident: CIT0026
– ident: CIT0028
– ident: CIT0032
– ident: CIT0005
– ident: CIT0024
  doi: 10.1109/SKG.2007.147
– ident: CIT0030
– volume-title: Proceedings of EAMT-CLAW03
  year: 2003
  ident: CIT0033
– ident: CIT0036
– volume: 5
  start-page: 51
  year: 2007
  ident: CIT0037
  publication-title: Journal of Web Semantics
  doi: 10.1016/j.websem.2007.03.004
– ident: CIT0008
  doi: 10.1017/S0269888900005476
SSID ssj0001771
Score 1.8644166
Snippet Formal ontologies are difficult to read and understand for domain experts who do not have a background in formal logic. This severely restricts the ability of...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 149
SubjectTerms Knowledge
Linguistics
Logic
Ontology
Title CREATING AND QUERYING FORMAL ONTOLOGIES VIA CONTROLLED NATURAL LANGUAGE
URI https://www.tandfonline.com/doi/abs/10.1080/08839510903448700
https://www.proquest.com/docview/215862058
https://www.proquest.com/docview/743657471
Volume 24
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bb9MwFLbQeOEFxk2UMeQHnqiC7Ni59DHqQgfqiigpGk-R49hi0tROW6Yhfj3HsZ1kK6pgL1GT2nHk8_lcfPkOQu9UGAowrDpIQlYFnEsZTBSrYbjXCZVagEkxUwMni_h4xT-fRqc-Z7s7XdJUH-Tvv54ruY9U4RnI1ZyS_Q_Jdi-FB_Ab5AtXkDBc_0nG02WeFWa6yXBEfV3lyx_mBuK6E7OdZ1G0mQ7yb-Pvn7LxFO6XX-bz_Gjc7nWAEvNsMVtls3zooHqv1LTmyCXOBqyd_brNz5uzxiX1WG7O9XD2oN2ENpw9KLYSeQzmvLwWYgG4YTbqV1ZLEtBMcWR5IL0atUehPVzcmUarFallJXUGltq0PFu62212hPaM1zcxXISgTEhvqLrtg5xD-Awh78MQYgOTtoKRRWd-adJG2d13-6VsQ6h-9923nJFbVLVbprn1N4p99NgFCjizUn-KHqj1M_TEJ-HATic_RzMPAgwgwB4E2IIA9yDAAALcgwA7EGAPghdo9TEvpseBy44RSHCym4BW3NAnxjqKNQt1DdqVCVGFE7NAOVFEsYRwLqhQtUh1BY6mimlKtFBc8jSU7CXaW2_W6hXCIlKE6JQwWVMOEbaAWlxSWqcqIqpORoj4biqlo443GUzOS-oZZu_27Ai976pcWN6UXYXJsO_LpkWltoDcLl42v5oRinZUYTuaOvByLd1IvirB7YXAnkTpCOHuX1CzZu1MrNXm-qoERzuOzATO63s2fIAe9ePvDdprLq_VIfizTfW2xe8f2xiLEQ
linkProvider Taylor & Francis
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9swDCaG7rBd1j2xtN2mQ08D3EmW_DoaqZtkdVwsS4buJMiydGmRFo0DFP31pfwI1nbIoUfDlGVbIvmRIj4CHBrfV-hYrRf5vPSE0NpLDK9Q3auIaavQpbjUwLQIxwvx8zw47xJuq66s0sXQtiWKaGy1U26XjO5L4n6gZnCHDBLHV4cbDkP2l0ESRq6DAafFxhKzqAm4nLiH8qI_1fzfIx74pQespU-sdON6TnZB9i_dVpxcHK3r8kjfPeJzfP5XvYU3HSolabuN3sELs3wPu33HB9IZgA8wGs6ydD4pRiQtjsmvRTb76y4wkpymOTkr5k1vhew3-TNJyRCvZ2d5nh2TproCJfK0GC3SUfYRFifZfDj2ulYMnkZEV3usFI6rL7RBaLlvK1RlrlTpJ-40LDHU8IgKoZgylYptiajGhCymVhmhRexr_gl2lldL8xmICgylNqZcV0xgOKdwlNCMVbEJqKmiAdB-IaTueMpdu4xLyXo608c_agDfN0OuW5KObcL039WVdZMZsW0bk6fisr6tBxBsGcK3TLXf7xzZmYaVRIyFUSQN4gGQzV3UaXdQo5bmar2SiOrCwGUL9p458Td4NZ5Pc5lPitN9eN1WPLi00QHs1Ddr8wWBVF1-bbTlHgShCG0
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELUQSIgLZRVl9YETUsCOnaXHqE1LIQQoLYJT5Dj2BVQQTSXE1zPOUrGpB45RxrES-83myRuEjpVtCzCs2vJsllqcS2m1FMsA7plHpRZgUkxq4Cp2z0f84sF5qGpzJlVZpYmhdUkUUehqA-7XTNcVcWcADGYcg5ahq4P9BhH7kmuIw80fHCSeKWLqFfGWEbdAnteHmn894ptZ-kZa-ktJF5an2yjbq04KwkJTcPJ0Os3TU_nxg87x3y-1hlYrnxQH5SZaRwtqvIEadb8HXMF_E_XagzAY9uMeDuIOvh2Fg0dzAXHkVRDh63hYdFYI7_B9P8BtuB5cR1HYwUVtBUhEQdwbBb1wC4264bB9blWNGCwJ_lxu0ZQbpj5XO65mts4AyEyI1G6Zs7CWIop5hHNBhcqEr1PwaZRLfaKF4pL7tmTbaHH8MlY7CAtHEaJ9wmRGOQRzAkZxSWnmK4eozGsiUq9DIiuWctMs4zmhNZnpzw_VRCezIa8lRcc8YfJ1cZO8yIvosonJb_Ekf8-byJkzhM2Zaq_eOEmlGCYJeFgQQxLHbyI8uwuINsc0YqxeppMEfDrXMbmC3X9OfISWbzrdJOrHl3topSx3MDmjfbSYv03VAXhReXpYYOUTnAIHEQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=CREATING+AND+QUERYING+FORMAL+ONTOLOGIES+VIA+CONTROLLED+NATURAL+LANGUAGE&rft.jtitle=Applied+artificial+intelligence&rft.au=Schwitter%2C+Rolf&rft.date=2010-01-01&rft.pub=Taylor+%26+Francis+Group&rft.issn=0883-9514&rft.eissn=1087-6545&rft.volume=24&rft.issue=1-2&rft.spage=149&rft.epage=174&rft_id=info:doi/10.1080%2F08839510903448700&rft.externalDocID=445231
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0883-9514&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0883-9514&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0883-9514&client=summon