Chapter 1 Introduction
A.2 Middle Ontology Elements
A.2.3 Properties of Place as Cultural Heritage
Property cit:has quality
Domain cit:Place CH
Range cit:Quality
Sub-property of
Quantification many to many (1,n:0:n)
Scope Note This property identifies a quality of a place.
Example Arequipahas quality Climateclassifies Dry F.O. Logic hasquality(x, y)⊂P lace(x)
Comment
Property cit:describes
Domain cit:Description
Range crm:Thing
Sub-property of
Quantification many to many (0,n:0:n)
Scope Note This property associates a description with an entity.
Example El poblador arequipe˜no se caracteriza .... describes Arequipa F.O. Logic describes(x, y)⊂P laceCH(x)
Comment
86 Department of Computer Science
Appendix B
CURIOCITY: Inference Rules
The proposed inference rules contain the following propositions:
❼ Interval : V
❼ Proper Interval : T
❼ hasBeggining
❼ hasEnd
❼ intervalBef ore
❼ intervalAf ter
❼ intervalM eets
❼ intervalM etBy
❼ intervalOverlaps
❼ intervalOverlappedBy
❼ intervalStarts
❼ intervalStartedBy
❼ during
❼ contains
❼ f inishes
❼ f inishedBy
❼ equals
❼ lessT han
❼ greaterT han
❼ equal
Reasoning: Proper Interval
AnInterval whose beginning and end are not equals is a Proper Interval.
Interval(V)∧hasBeggining(V, V begin)∧hasEnd(V, V end)∧. . .
· · · ∧notEqual(V begin, V end)→P roper(V) (B.1)
Reasoning: Interval before
Let twoProper IntervalsT1 andT2, andT1 end is less thanT2 beginning, then T1 is an Interval before T2.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧hasEnd(T1, T1end)∧hasBeggining(T2, T2begin)∧. . .
· · · ∧lessT han(T1end, T2begin)→intervalBef ore(T1, T2)
(B.2)
Reasoning: Interval after
Let two Proper Intervals T1 and T2, and it is known that T1 is an Interval before T2, theT2 is an Interval after T1.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧intervalBef ore(T1, T2)→intervalAf ter(T2, T1) (B.3)
86 Universidad Cat´olica San Pablo
‘
Reasoning: Interval meets
Let twoProper Intervals T1 and T2, andT1 end is equal to theT2 beginning, the T1 meets T2.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧hasEnd(T1, T1end)∧hasBeggining(T2, T2begin)∧. . .
· · · ∧equal(T1end, T2begin)→intervalM eets(T1, T2)
(B.4)
Reasoning: Interval met by
Let two Proper IntervalsT1 andT2, and it is known that T1 meets T2, then T2 is met by T1.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧intervalM eets(T1, T2)→intervalM etBy(T2, T1) (B.5)
Reasoning: Interval overlaps
Let two Proper Intervals T1 and T2, and T1 beginning is less than T2 beginning, and T2 beginning is less thanT1 end, and T1 is less than T2 end, then T1 overlaps T2.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧hasBeggining(T1, T1begin)∧hasEnd(T1, T1end)∧. . .
· · · ∧hasBeggining(T2, T2begin)∧hasEnd(T2, T2end)∧. . .
· · · ∧lessT han(T1begin, T2begin)∧. . .
· · · ∧lessT han(T2begin, T1end)∧. . .
· · · ∧lessT han(T1end, T2end)→intervalOverlaps(T1, T2)
(B.6)
Reasoning: Interval overlapped by
Let two Proper IntervalsT1 andT2, and it is known that T1 overlaps T2, then T2 is overlapped by T1.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧intervalOverlaps(T1, T2)→intervalOverlappedBy(T2, T1) (B.7)
Reasoning: Interval starts
Let two Proper Intervals T1 and T2, and T1 beginning is equal to T2 beginning, and T1 beginning is less thanT2 end, thenT1 starts T2.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧hasBeggining(T1, T1begin)∧hasEnd(T1, T1end)∧. . .
· · · ∧hasBeggining(T2, T2begin)∧hasEnd(T2, T2end)∧. . .
· · · ∧equal(T1begin, T2begin)∧lessT han(T1end, T2end)→intervalStarts(T1, T2)
(B.8)
Reasoning: Interval started by
88 Department of Computer Science Let twoProper IntervalsT1 andT2, and it is knownT1 startsT2, thenT2 is started by T1.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧intervalStarts(T1, T2)→intervalStartedBy(T2, T1) (B.9)
Reasoning: Interval during
Let two Proper Intervals T1 and T2, T1 beginning is greater than T2 beginning, and T1 end is less thanT2 end, thenT1 is interval during T2.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧hasBeggining(T1, T1begin)∧hasEnd(T1, T1end)∧. . .
· · · ∧hasBeggining(T2, T2begin)∧hasEnd(T2, T2end)∧. . .
· · · ∧greaterT han(T1begin, T2begin)∧lessT han(T1end, T2end)→intervalDuring(T1, T2)
(B.10)
Reasoning: Interval contains
Let twoProper IntervalsT1 andT2, and it is known thatT1 is duringT2, then T2 contains T1.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧intervalDuring(T1, T2)→intervalContains(T2, T1) (B.11)
Reasoning: Interval finishes
Let two Proper Intervals T1 and T2, T1 beginning is greater than T2 beginning, and T1 end is equal to T2 end, then T1 finishes T2.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧hasBeggining(T1, T1begin)∧hasEnd(T1, T1end)∧. . .
· · · ∧hasBeggining(T2, T2begin)∧hasEnd(T2, T2end)∧. . .
· · · ∧greaterT han(T1begin, T2begin)∧equal(T1end, T2end)→intervalF inishes(T1, T2)
(B.12)
Reasoning: Interval finished by
Let twoProper Intervals T1 and T2, and it is known that T1 finishes T2, then T2 is finished by T1.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧intervalF inishes(T1, T2)→intervalF inishedBy(T2, T1) (B.13)
Reasoning: Interval equals
Let two Proper Intervals T1 and T2, T1 beginning is equal to T2 beginning, and T1 end is equal to T2 end, then T1 equals T2.
P roperInterval(T1)∧P roperInterval(T2)∧. . .
· · · ∧hasBeggining(T1, T1begin)∧hasEnd(T1, T1end)∧. . .
· · · ∧hasBeggining(T2, T2begin)∧hasEnd(T2, T2end)∧. . .
· · · ∧equal(T1begin, T2begin)∧equal(T1end, T2end)→intervalEquals(T1, T2)
(B.14)
88 Universidad Cat´olica San Pablo
Appendix C
SPARQL Queries
Code C.1: General query prefixes
PREFIX:<http://curiocity.org/>
PREFIX ecrm:<http://erlangen❂crm.org/170309/>
PREFIX rdfs:<http://www.w3.org/2000/01/rdf❂schema#>
PREFIX time:<http://www.w3.org/2006/time#>
PREFIX cit:<http://curiocity.org/>
PREFIX owl:<http://www.w3.org/2002/07/owl#>
PREFIX xsd:<http://www.w3.org/2001/XMLSchema#>
Code C.2: Check existence of ID
ASK{:idaecrm:E42 Identifier .}
Code C.3: Multiple criteria search query
SELECT DISTINCT?id l ?artifact l
(COALESCE (?author lab, ”unknown”)AS?author l)
?material l ? location l
(COALESCE (?donor lab, ”unknown”)AS?donor l) (COALESCE (?period lab, ”unknown”)AS?period l) (COALESCE (?begin date, ”unknown”)AS?begin d) (COALESCE (?end date, ”unknown”)AS?end d)
?note
(COALESCE (?note donor , ”unknown”)AS?note donor) (BOUND (?tag)AS?verified)
WHERE{
? artifact aecrm:E22 Man❂Made Object ; rdfs: label ? artifact l ;
ecrm: P48 has preferred identifier ?id ; ecrm:P55 has current location ?location ; ecrm:P3 has note ?note ;
ecrm:P45 consists of ?material .
?material rdfs: label ?material l .
?id rdfs: label ? id l .
?location rdfs: label ? location l .
?prodecrm:P108 has produced ?artifact .
OPTIONAL{?prodecrm:P14 carried out by ?author .
?author rdfs: label ?author lab . }
OPTIONAL{?prodecrm:P4 has time❂span/(ˆecrm:P4 has time❂span) ?period .
?period ecrm:P4 has time❂span/(ˆcit:Q14 defines time) ?interval.
90 Department of Computer Science
?period a ecrm:E4 Period ; rdfs: label ?period lab .
? interval time:hasBeginning/(time:in XSD date|time:in XSD g❂Year) ?begin date .
? interval time:hasEnd/(time:in XSD date|time:in XSD g❂Year) ?end date .} OPTIONAL{?artifactecrm:P2 has type ?tag .FILTER(?tag = :Verified)}
#❂>Filters insertion
FILTER(regex(str(?filter wildcard ), ”filter match”,”i”)) }
Code C.4: Simple criteria search query
SELECT?subject ?subject l WHERE{
VALUES ?type{ values}
?subject a ?type ; rdfs: label ? subject l .
FILTER (regex(str(?subject l) , ”filter tag” , ”i”) ) }
Code C.5: Data insertion query
INSERT DATA{
:id urla ecrm:E42 Identifier , owl:NamedIndividual ;
rdfs: label ”id”ˆˆxsd:string ;
:P190 has symbolic content ”id”ˆˆxsd:string ; ecrm:P2 has type :ID❂RUTAS .
<http://curiocity.org/id url/Object>aecrm:E22 Man❂Made Object, owl:NamedIndividual ;
rdfs: label ”title”ˆˆxsd:string ;
ecrm:P3 has note ”””description”””ˆˆxsd:string ; ecrm:P45 consists of material;
ecrm: P48 has preferred identifier :id; ecrm:P55 has current location location.
<http://curiocity.org/id url/Production>a ecrm:E12 Production;
ecrm:P108 has produced <http://curiocity.org/id url/Object>; ecrm:P14 carried out byauthor .
}
Code C.6: Data update query
DELETE{?subject property value before} INSERT{?subject property value after} WHERE{
? artifact ecrm: P48 has preferred identifier /rdfs: label ”id” .
? artifact aecrm:E22 Man❂Made Object ; rdfs: label ? artifact l ;
ecrm:P55 has current location ?location ; ecrm:P3 has note ?note ;
ecrm:P45 consists of ?material .
?prodecrm:P108 has produced ?artifact . OPTIONAL{
?prod ecrm:P14 carried out by ?author .
?author rdfs: label ?author l . } }
90 Universidad Cat´olica San Pablo
Code C.7: Delete artifact query
DELETE{?artifact ?p ?o . ?s art ?p art ? artifact .
?production ?p1 ?o1 . ?s pro ?p pro ?production .
? acquisition ?p2 ?o2 . ?s acq ?p acq ?acquisition .
?dimension ?p3 ?o3 . ?s dim ?p dim ?dimension .
? utility ?p4 ?o4 . ? s util ? p util ? utility .
?condition ?p5 ?o5 . ?s con ?p con ?condition .
?id ?p6 ?o6 . ?s id ?p id ?id .
?process ?p7 ?o7 . ?s proc ?p proc ?process . } WHERE{BIND( :idAS?id)
BIND(<http://curiocity.org/id/Production>AS?production) BIND(<http://curiocity.org/id/Object>AS?artifact)
BIND(<http://curiocity.org/id/Measurements>AS?dimension) BIND(<http://curiocity.org/id/Adquisition>AS?acquisition) BIND(<http://curiocity.org/id/Utility>AS?utility)
BIND(<http://curiocity.org/id/Current Condition>AS?condition) { ? artifact ecrm: P48 has preferred identifier ?id ;
?p ?o .
?s art ?p art ? artifact .}
UNION{?productionecrm:P108 has produced? ?artifact ;
?p1 ?o1 .
?s pro ?p pro ?production . }
UNION{?acquisitionecrm:P30 transferred custody of ?artifact ;
?p2 ?o2 .
?s acq ?p acq ?acquisition . }
UNION{?artifactecrm:P43 has dimension ?dimension .
?dimension ?p3 ?o3 .
?s dim ?p dim ?dimension . }
UNION{?artifact ecrm:P2 has type ?utility .
? utility ?p4 ?o4 .
? s util ? p util ? utility . }
UNION{?artifactecrm:P44 has condition ?condition .
?condition ?p5 ?o5 .
?s con ?p con ?condition . } UNION{?id aecrm:E42 Identifier ;
?p6 ?o6 .
?s id ?p id ?id . }
UNION{?process :L1 digitized ? artifact ;
?p7 ?o7 .
?s proc ?p proc ?process . } }
Code C.8: Get ID from label
SELECT?o WHERE{
?s a ecrm:E22 Man❂Made Object ; rdfs: label ” artifact label” ;
ecrm: P48 has preferred identifier ?o . }
Code C.9: Get Period of artwork from label
SELECT?label WHERE{
?prodecrm:P108 has produced ?artifact ; ecrm:P4 has time❂span ?span .
?period ecrm:P4 has time❂span ?span ;
92 Department of Computer Science
a ecrm:E4 Period ; rdfs: label ?label . {
SELECT(?sas?artifact) WHERE{
?s aecrm:E22 Man❂Made Object ; rdfs: label ” artifact label” ;
ecrm: P48 has preferred identifier ?o . }
} }
Code C.10: Get Creator of artwork
SELECT?label WHERE{
?prodecrm:P108 has produced ?artifact ; ecrm:P14 carried out by ?creator .
?creator rdfs: label ?label . {
SELECT(?sas?artifact) WHERE{
?s aecrm:E22 Man❂Made Object ; rdfs: label ” artifact label” ;
ecrm: P48 has preferred identifier ?o . }
} }
Code C.11: How old an artifact is?
SELECT?bdate ?edate WHERE
{
VALUES?type{time:in XSD datetime:in XSD g❂Year}
?prodecrm:P108 has produced ?artifact ; ecrm:P4 has time❂span ?span .
?period ecrm:P4 has time❂span ?span ; a ecrm:E4 Period .
? interval atime: Interval ; cit:Q14 defines time ?span ; time:hasBeginning ?begin ; time:hasEnd ?end .
?begin ?type ?bdate .
?end ?type ?edate . {
SELECT(?sas?artifact) WHERE{
?s aecrm:E22 Man❂Made Object ; rdfs: label ” artifact label” ;
ecrm: P48 has preferred identifier ?o . }
} }
92 Universidad Cat´olica San Pablo
Code C.12: Get artifact description (technique)
SELECT?note WHERE {
? artifact ecrm:P3 has note ?note {
SELECT(?sas?artifact) WHERE{
?s aecrm:E22 Man❂Made Object ; rdfs: label ” artifact label” ;
ecrm: P48 has preferred identifier ?o . }
} }
Code C.13: Get acquisition description (how the artifact was obtained?)
SELECT?donor l ?receiver l ?note WHERE
{
? transfer aecrm:E10 Transfer of Custody ; ecrm:P30 transferred custody of ?artifact ; ecrm:P28 custody surrendered by ?donor ; ecrm:P29 custody received by ?receiver ; ecrm:P3 has note ?note .
?donorrdfs: label ?donor l .
? receiver rdfs: label ? receiver l . {
SELECT(?sas?artifact) WHERE{
?s aecrm:E22 Man❂Made Object ; rdfs: label ”Artefacto Ejemplo” ; ecrm: P48 has preferred identifier ?o . }
} }
Code C.14: Get artifact usefullness
SELECT?artifact ?util l WHERE
{
? artifact ecrm:P2 has type ?utility .
? utility rdfs: label ? util l {
SELECT(?sas?artifact) WHERE{
?s aecrm:E22 Man❂Made Object ; rdfs: label ”Artefacto Ejemplo” ; ecrm: P48 has preferred identifier ?o . }
} }
94 Department of Computer Science Code C.15: Get artifact material
SELECT?artifact ?material l WHERE
{
? artifact ecrm:P2 has type ?utility ; ecrm:P45 consists of ?material .
?material rdfs: label ?material l . {
SELECT(?sas?artifact) WHERE{
?s aecrm:E22 Man❂Made Object ; rdfs: label ”Artefacto Ejemplo” ; ecrm: P48 has preferred identifier ?o . }
} }
Code C.16: Get artifact label coincidences
SELECT?l WHERE{
?s a ecrm:E22 Man❂Made Object ; rdfs: label ?l .
FILTER(regex(?l , ”query label”, ”i ”)) }
Code C.17: Get images related to an artifact
SELECT?img ?artifact l WHERE{
?img a cit:D9 Data Object ; cit:T1 has blue valueblue value; cit:T1 has green valuegreen value; cit:T1 has red valuered value .
?proces a cit:D2 Digitization Process ; ecrm:L20 has created ?img ;
ecrm:L1 digitized ? artifact .
? artifact rdfs: label ? artifact l ; }
94 Universidad Cat´olica San Pablo
Bibliography
[Addis et al., 2003] Addis, M., Boniface, M., Goodall, S., Grimwood, P., Kim, S., Lewis, P., Martinez, K., and Stevenson, A. (2003). SCULPTEUR: Towards a new paradigm for multimedia museum information handling. InLecture Notes in Computer Science, pages 582–596. Springer Berlin Heidelberg.
[Araujo et al., 2016] Araujo, C., Henriques, P. R., Martini, R. G., and Almeida, J. J.
(2016). Architectural approaches to build the museum of the person. In 2016 11th Iberian Conference on Information Systems and Technologies (CISTI). IEEE.
[Ara´ujo et al., 2017] Ara´ujo, C., Martini, R. G., Henriques, P. R., and Almeida, J. J.
(2017). Annotated documents and expanded CIDOC-CRM ontology in the automatic construction of a virtual museum. InDevelopments and Advances in Intelligent Systems and Applications, pages 91–110. Springer International Publishing.
[Ashworth and Page, 2011] Ashworth, G. and Page, S. J. (2011). Urban tourism research:
Recent progress and current paradoxes. Tourism Management, 32(1):1–15.
[Bahramian and Abbaspour, 2015] Bahramian, Z. and Abbaspour, R. A. (2015). An ontology-based tourism recommender system based on spreading activation model. In- ternational Archives of the Photogrammetry, Remote Sensing & Spatial Information Sciences, 40.
[Buffa et al., 2016] Buffa, M., Faron Zucker, C., Bergeron, T., and Aouzal, H. (2016).
Semantic Web Technologies for improving remote visits of museums, using a mobile robot. Proceedings of the ISWC 2016 Posters & Demonstrations Track co-located with 15th International Semantic Web Conference (ISWC2016). Poster.
[Cardinale et al., 2020] Cardinale, Y., Cornejo, M., Ticona, R., and Barrios, D. (2020).
A methodological approach to compare ontologies: Proposal and application for slam ontologies. InThe 22nd International Conference on Information Integration and Web- based Applications & Services.
[Cardinale et al., 2021] Cardinale, Y., Cornejo-Lupa, M. A., Pinto-De la Gala, A., and Ticona-Herrera, R. (2021). Application of a methodological approach to compare on- tologies. International Journal of Web Information Systems.
[Cardoso, 2006] Cardoso, J. (2006). Developing an owl ontology for e-tourism. InSeman- tic Web Services, Processes and Applications, pages 247–282. Springer US.
[Chanhom and Anutariya, 2019] Chanhom, W. and Anutariya, C. (2019). TOMS: A linked open data system for collaboration and distribution of cultural heritage artifact
96 Department of Computer Science collections of national museums in thailand. New Generation Computing, 37(4):479–
498.
[Chinnapatjeerat et al., 2016] Chinnapatjeerat, R., Tuamsuk, K., and Supnithi, T.
(2016). Ontology of information for tourism development planning in thailand. In Int. Conf. on Computer Science and Network Technology (ICCSNT), pages 856–878.
[DBPEDIA, 2020] DBPEDIA (2020). Dbpedia. Accessed: 6-5-2020.
[Dell’Erba et al., 2002] Dell’Erba, M. et al. (2002). Harmonise: A solution for data inter- operability.
[Doerr, 2005] Doerr, M. (2005). The cidoc crm, an ontological approach to schema het- erogeneity. In Kalfoglou, Y., Schorlemmer, M., Sheth, A., Staab, S., and Uschold, M., editors, Semantic Interoperability and Integration, number 04391 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany. Internationales Begegnungs- und Forschungszentrum f¨ur Informatik (IBFI), Schloss Dagstuhl, Germany.
[Doerr et al., 2003] Doerr, M., Hunter, J., and Lagoze, C. (2003). Towards a core ontology for information integration. Journal of Digital information, 4(1).
[Doerr and Theodoridou, 2014] Doerr, M. and Theodoridou, M. (2014). Crmdig an exten- sion of cidoc-crm to support provenance metadata. Technical report, Technical Report 3.2. Heraklion: ICS-FORTH.
[Domingue et al., 2011] Domingue, Fensel, and Hendler (2011). Handbook of Semantic Web Technologies. Springer Berlin Heidelberg.
[Duque-Ramos et al., 2011] Duque-Ramos, A., Fernandez-Breis, J., Stevens, R., and Aussenac-Gilles, N. (2011). Oquare: A square-based approach for evaluating the quality of ontologies. Journal of Research and Practice in Information Technology, 43:159–176.
[EDM, 2020] EDM (2020). Europeana data model pro. Accessed: 6-5-2020.
[Fensel, 2004] Fensel, D. (2004). Ontologies. Springer Berlin Heidelberg.
[FINTO, 2020] FINTO (2020). Finish thesaurus and ontology service. Accessed: 6-5- 2020.
[FoodOn, 2020] FoodOn (2020). Foodon. Accessed: 6-5-2020.
[Graves et al., 2007] Graves, M., Constabaris, A., and Brickley, D. (2007). FOAF: Con- necting people on the semantic web.Cataloging & Classification Quarterly, 43(3-4):191–
202.
[Hajmoosaei and Skoric, 2016] Hajmoosaei, A. and Skoric, P. (2016). Museum ontology- based metadata. In2016 IEEE Tenth International Conference on Semantic Computing (ICSC). IEEE.
[Hyv¨onen et al., 2005] Hyv¨onen, E., M¨akel¨a, E., Salminen, M., Valo, A., Viljanen, K., Saarela, S., Junnila, M., and Kettula, S. (2005). MuseumFinland—finnish museums on the semantic web. Journal of Web Semantics, 3(2-3):224–241.
[ICOM, 2020] ICOM (2020). Crmgeo spatiotempotal model. Accessed: 6-5-2020.
96 Universidad Cat´olica San Pablo
[Jian et al., 2005] Jian, N., Hu, W., Cheng, G., and Qu, Y. (2005). Falcon-AO: Aligning ontologies with Falcon. InWorkshop on Integrating Ontologies, pages 87–93.
[Kongthon et al., 2011] Kongthon, A. et al. (2011). A semantic based question answering system for Thailand tourism information. In Proc. of the KRAQ11 workshop, pages 38–42, Chiang Mai. Asian Federation of NLP.
[Loulanski, 2006] Loulanski, T. (2006). Revising the concept for cultural heritage: The argument for a functional approach.International Journal of Cultural Property, 13(02).
[Marchenkov et al., 2017] Marchenkov, S. A., Vdovenko, A. S., Petrina, O. B., and Ko- rzun, D. G. (2017). Smart museum of everyday life history in petrozavodsk state university: Software design and implementation of the semantic layer. In 2017 21st Conference of Open Innovations Association (FRUCT). IEEE.
[MINCETUR-PERU, 2015] MINCETUR-PERU (2015). Medici´on econ´omica del tur- ismo. https://www.mincetur.gob.pe/ Accessed: 6-5-2020.
[Missikoff et al., 2003] Missikoff, M. et al. (2003). Harmonise–towards interoperability in the tourism domain.
[Moreno et al., 2013] Moreno, A. et al. (2013). Sigtur/e-destination: Ontology-based per- sonalized recommendation of tourism and leisure activities. Engineering Applications of Artificial Intelligence, pages 633 – 651.
[Mulholland et al., 2012] Mulholland, P., Wolff, A., and Collins, T. (2012). Curate and storyspace: An ontology and web-based environment for describing curatorial narra- tives. InLecture Notes in Computer Science, pages 748–762. Springer Berlin Heidelberg.
[Nielsen, 1994] Nielsen, J. (1994). Usability engineering. Morgan Kaufmann.
[Nys et al., 2018] Nys, G.-A., Van Ruymbeke, M., and Billen, R. (2018). Spatio-temporal reasoning in cidoc crm: an hybrid ontology with geosparql and owl-time. In CEUR Workshop Proceedings, volume 2230. RWTH Aachen University.
[Obitko, 2001] Obitko, M. (2001). Ontologies – description and applications. Technical report, CZECH TECHNICAL UNIVERSITY, DEPARTMENT OF.
[Ou et al., 2008] Ou, S., Pekar, V., Orasan, C., Spurk, C., and Negri, M. (2008). Devel- opment and alignment of a domain-specific ontology for question answering. In Pro- ceedings of the Sixth International Conference on Language Resources and Evaluation (LREC’08), Marrakech, Morocco.
[Ozdikis et al., 2011] Ozdikis, O. et al. (2011). Ontology-based recommendation for points of interest retrieved from multiple data sources. In Proceedings of the International Workshop on Semantic Web Information Management, SWIM ’11, New York, NY, USA. ACM.
[Pease et al., 2002] Pease, A. et al. (2002). The suggested upper merged ontology: A large ontology for the semantic web and its applications. InWorking notes of the AAAI-2002 workshop on ontologies and the semantic web.