Computational aspects of an order-sorted logic with term declarations
Computational aspects of an order-sorted logic with term declarations
An order-sorted logic for knowledge representation systems
Artificial Intelligence
Event, property and hierarchy in order-sorted logic
Proceedings of the 1999 international conference on Logic programming
Identity criteria and sortal concepts
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Towards a consistent logical framework for ontological analysis
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Supporting ontological analysis of taxonomic relationships
Data & Knowledge Engineering - ER2000
An Order-Sorted Resolution with Implicitly Negative Sorts
Proceedings of the 17th International Conference on Logic Programming
IC-based ontology expansion in devouring accessibility
AOW '05 Proceedings of the 2005 Australasian Ontology Workshop - Volume 58
Unification of sorts among local ontologies for semantic web applications
AIKED'05 Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases
| Hi-index | 0.00 |
Guarino and Welty have developed the notion of identity condition (IC) as a subsumption constraint of ontological analysis, that is, IC must be inherited or carried among sorts In practical cases, a sort is often regarded to carry more than one identity condition via inheritance Thus, we provided the idea of multiple ICs in [8] Here, we extend our idea in order-sorted logic because this logic is one of the most promising ways to treat a sort ontology For this purpose, we reconsider the definition of identity and rigidity in terms of order-sorted language and possible world semantics Then, we propose an inheritance mechanism of identity conditions in order to solve subsumption inconsistency among sorts We present a practical example of knowledge management to illustrate the advantages of our formalism.