Within knowledge representation, ontologies are logical theories that support software integration and decision support systems. Ontology verification is concerned with the relationship between the intended structures for an ontology and the models of the axiomatization of the ontology. To verify a particular ontology, we ideally characterize all the models of the ontology up to elementary equivalence and prove that these models are equivalent to the intended structures for the ontology. In this paper, we investigate the use of automated theorem provers and model finders to assist in the interactive verification of firstorder ontologies. We identify the reasoning tasks that are associated with different aspects of ontology verification and discuss challenges for the application of automated reasoning systems to support these tasks.
[1]
Sheila A. McIlraith,et al.
Partition-based logical reasoning for first-order and propositional theories
,
2005,
Artif. Intell..
[2]
Geoff Sutcliffe,et al.
First Order Reasoning on a Large Ontology
,
2007,
ESARLT.
[3]
Ian Horrocks,et al.
Modular Reuse of Ontologies: Theory and Practice
,
2008,
J. Artif. Intell. Res..
[4]
Michael Grüninger,et al.
Theorem Proving in the Ontology Lifecycle
,
2010,
KEOD.
[5]
Torsten Hahmann,et al.
Ontology Verification with Repositories
,
2010,
FOIS.
[6]
William M. Farmer.
An Infrastructure for Intertheory Reasoning
,
2000,
CADE.