An Ontology Formalization of Relation Type Hierarchy in Conceptual Structure Theory

Authors:
Philip H. Nguyen;Ken Kaneiwa;Dan R. Corbett;Minh-Quang Nguyen
Affiliations:
Dep. of Justice, Gov. of South Australia, Justice Technology Services, Adelaide, Australia;National Institute of Information and Communications Technology, Kyoto, Japan;Schafer Corporation, Arlington, USA;EMT Lab, Institut National de Recherche Scientifique, Montreal, Canada
Venue:
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2008

Citing 8
Cited 1

New HELIC-II: a software tool for legal reasoning

ICAIL '95 Proceedings of the 5th international conference on Artificial intelligence and law
Efficient reasoning

ACM Computing Surveys (CSUR)
Reasoning and Unification over Conceptual Graphs

Reasoning and Unification over Conceptual Graphs
Order-sorted logic programming with predicate hierarchy

Artificial Intelligence
A Basic Mathematical Framework for Conceptual Graphs

IEEE Transactions on Knowledge and Data Engineering
Differentiating conceptual modelling from data modelling, knowledge modelling and ontology modelling and a notation for ontology modelling

APCCM '08 Proceedings of the fifth Asia-Pacific conference on Conceptual Modelling - Volume 79
An upper ontology for event classifications and relations

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Building corporate knowledge through ontology integration

PKAW'06 Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management

Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring

ISWC '09 Proceedings of the 8th International Semantic Web Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an enhancement to ontology formalization, combining previous work in Conceptual Structure Theory and Order-Sorted Logic. In particular, the relation type hierarchy of the former theory is a subset of the predicate hierarchy of the latter. Most existing ontology formalisms place greater importance on concept types, but this paper focuses more on relation types, which are in essence predicates on concept types. New notions are introduced and new properties identified with the aim of completing missing arguments in relation types. The end result is a new ontology, that we call the closure of the original ontology, on which automated inference could be more easily produced (e.g., a query-answering system for legal knowledge).