Evaluating the Competency of a First-Order Ontology
Javier \'Alvez, Paqui Lucio, German Rigau
TL;DR
This paper evaluates the competency of a first-order ontology, Adimen-SUMO, for automated theorem proving using competency questions derived from semantic patterns and WordNet mappings.
Contribution
It adapts and applies a competency question methodology to first-order logic ontologies, demonstrating feasibility with Adimen-SUMO v2.4.
Findings
ATP can resolve non-trivial inferences in Adimen-SUMO
Competency questions effectively evaluate ontology competency
Methodology can be automated from semantic patterns and WordNet
Abstract
We report on the results of evaluating the competency of a first-order ontology for its use with automated theorem provers (ATPs). The evaluation follows the adaptation of the methodology based on competency questions (CQs) [Gr\"uninger&Fox,1995] to the framework of first-order logic, which is presented in [\'Alvez&Lucio&Rigau,2015], and is applied to Adimen-SUMO [\'Alvez&Lucio&Rigau,2015]. The set of CQs used for this evaluation has been automatically generated from a small set of semantic patterns and the mapping of WordNet to SUMO. Analysing the results, we can conclude that it is feasible to use ATPs for working with Adimen-SUMO v2.4, enabling the resolution of goals by means of performing non-trivial inferences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.