Predefined clause-based structure to subdue blank node issues

Mary Ting, Abdul Kadir Rabiah, Azreen Azman, Tengku Mohd Tengku Sembok, Fatimah Ahmad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

World Wide Web provides vast of resources to the public. Currently, many researches have been done on resources sharing among users through implementation of ontologies. Knowledge in an ontology are represented in the form of triple(s-p-o), where concepts are brought together by a relation. In a situation where there is a need to represent a resource which exist without IRI, blank node can be implemented in placed of the resource. Increase number of blank nodes implemented will increase the complexity of ontology structure. Since it is impossible to avoid blank nodes implementation in the ontology, increase used of it might lead to the intractable of data during the information retrieval. This paper presents a new clause-based structure that able to handle N-ary, container, collection and reified knowledge issues brought by the blank node application. The result shows that the structure able to store complicated knowledge without the need to implement blank node.

Original languageEnglish
Title of host publicationInternational Conference on Intelligent Systems Design and Applications, ISDA
PublisherIEEE Computer Society
Pages187-192
Number of pages6
Volume2015-January
ISBN (Print)9781479979387
DOIs
Publication statusPublished - 23 Mar 2015
Event2014 14th International Conference on Intelligent Systems Design and Applications, ISDA 2014 - Okinawa, Japan
Duration: 28 Nov 201430 Nov 2014

Other

Other2014 14th International Conference on Intelligent Systems Design and Applications, ISDA 2014
CountryJapan
CityOkinawa
Period28/11/1430/11/14

Fingerprint

Ontology
Information retrieval
World Wide Web
Containers

Keywords

  • blank node
  • clause-based structure
  • container
  • N-ary
  • reification

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Signal Processing
  • Control and Systems Engineering

Cite this

Ting, M., Rabiah, A. K., Azman, A., Sembok, T. M. T., & Ahmad, F. (2015). Predefined clause-based structure to subdue blank node issues. In International Conference on Intelligent Systems Design and Applications, ISDA (Vol. 2015-January, pp. 187-192). [7066262] IEEE Computer Society. https://doi.org/10.1109/ISDA.2014.7066262

Predefined clause-based structure to subdue blank node issues. / Ting, Mary; Rabiah, Abdul Kadir; Azman, Azreen; Sembok, Tengku Mohd Tengku; Ahmad, Fatimah.

International Conference on Intelligent Systems Design and Applications, ISDA. Vol. 2015-January IEEE Computer Society, 2015. p. 187-192 7066262.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ting, M, Rabiah, AK, Azman, A, Sembok, TMT & Ahmad, F 2015, Predefined clause-based structure to subdue blank node issues. in International Conference on Intelligent Systems Design and Applications, ISDA. vol. 2015-January, 7066262, IEEE Computer Society, pp. 187-192, 2014 14th International Conference on Intelligent Systems Design and Applications, ISDA 2014, Okinawa, Japan, 28/11/14. https://doi.org/10.1109/ISDA.2014.7066262
Ting M, Rabiah AK, Azman A, Sembok TMT, Ahmad F. Predefined clause-based structure to subdue blank node issues. In International Conference on Intelligent Systems Design and Applications, ISDA. Vol. 2015-January. IEEE Computer Society. 2015. p. 187-192. 7066262 https://doi.org/10.1109/ISDA.2014.7066262
Ting, Mary ; Rabiah, Abdul Kadir ; Azman, Azreen ; Sembok, Tengku Mohd Tengku ; Ahmad, Fatimah. / Predefined clause-based structure to subdue blank node issues. International Conference on Intelligent Systems Design and Applications, ISDA. Vol. 2015-January IEEE Computer Society, 2015. pp. 187-192
@inproceedings{9d473b4b56d94797a2e5462ce4d05a20,
title = "Predefined clause-based structure to subdue blank node issues",
abstract = "World Wide Web provides vast of resources to the public. Currently, many researches have been done on resources sharing among users through implementation of ontologies. Knowledge in an ontology are represented in the form of triple(s-p-o), where concepts are brought together by a relation. In a situation where there is a need to represent a resource which exist without IRI, blank node can be implemented in placed of the resource. Increase number of blank nodes implemented will increase the complexity of ontology structure. Since it is impossible to avoid blank nodes implementation in the ontology, increase used of it might lead to the intractable of data during the information retrieval. This paper presents a new clause-based structure that able to handle N-ary, container, collection and reified knowledge issues brought by the blank node application. The result shows that the structure able to store complicated knowledge without the need to implement blank node.",
keywords = "blank node, clause-based structure, container, N-ary, reification",
author = "Mary Ting and Rabiah, {Abdul Kadir} and Azreen Azman and Sembok, {Tengku Mohd Tengku} and Fatimah Ahmad",
year = "2015",
month = "3",
day = "23",
doi = "10.1109/ISDA.2014.7066262",
language = "English",
isbn = "9781479979387",
volume = "2015-January",
pages = "187--192",
booktitle = "International Conference on Intelligent Systems Design and Applications, ISDA",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Predefined clause-based structure to subdue blank node issues

AU - Ting, Mary

AU - Rabiah, Abdul Kadir

AU - Azman, Azreen

AU - Sembok, Tengku Mohd Tengku

AU - Ahmad, Fatimah

PY - 2015/3/23

Y1 - 2015/3/23

N2 - World Wide Web provides vast of resources to the public. Currently, many researches have been done on resources sharing among users through implementation of ontologies. Knowledge in an ontology are represented in the form of triple(s-p-o), where concepts are brought together by a relation. In a situation where there is a need to represent a resource which exist without IRI, blank node can be implemented in placed of the resource. Increase number of blank nodes implemented will increase the complexity of ontology structure. Since it is impossible to avoid blank nodes implementation in the ontology, increase used of it might lead to the intractable of data during the information retrieval. This paper presents a new clause-based structure that able to handle N-ary, container, collection and reified knowledge issues brought by the blank node application. The result shows that the structure able to store complicated knowledge without the need to implement blank node.

AB - World Wide Web provides vast of resources to the public. Currently, many researches have been done on resources sharing among users through implementation of ontologies. Knowledge in an ontology are represented in the form of triple(s-p-o), where concepts are brought together by a relation. In a situation where there is a need to represent a resource which exist without IRI, blank node can be implemented in placed of the resource. Increase number of blank nodes implemented will increase the complexity of ontology structure. Since it is impossible to avoid blank nodes implementation in the ontology, increase used of it might lead to the intractable of data during the information retrieval. This paper presents a new clause-based structure that able to handle N-ary, container, collection and reified knowledge issues brought by the blank node application. The result shows that the structure able to store complicated knowledge without the need to implement blank node.

KW - blank node

KW - clause-based structure

KW - container

KW - N-ary

KW - reification

UR - http://www.scopus.com/inward/record.url?scp=84940486897&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940486897&partnerID=8YFLogxK

U2 - 10.1109/ISDA.2014.7066262

DO - 10.1109/ISDA.2014.7066262

M3 - Conference contribution

AN - SCOPUS:84940486897

SN - 9781479979387

VL - 2015-January

SP - 187

EP - 192

BT - International Conference on Intelligent Systems Design and Applications, ISDA

PB - IEEE Computer Society

ER -