A Modular Consistency Proof for DOLCE

Authors

  • Oliver Kutz University of Bremen
  • Till Mossakowski DFKI GmbH and University of Bremen

Abstract

We propose a novel technique for proving the consistency of large, complex and heterogeneous theories for which ‘standard’ automated reasoning methods are considered insufficient. In particular, we exemplify the applicability of the method by establishing the consistency of the foundational ontology DOLCE, a large, first-order ontology. The approach we advocate constructs a global model for a theory, in our case DOLCE, built from smaller models of subtheories together with amalgamability properties between such models. The proof proceeds by (i) hand-crafting a so-called architectural specification of DOLCE which reflects the way models of the theory can be built, (ii) an automated verification of the amalgamability conditions, and (iii) a (partially automated) series of relative consistency proofs.

Downloads

Published

2011-08-04

How to Cite

Kutz, O., & Mossakowski, T. (2011). A Modular Consistency Proof for DOLCE. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 227-234. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/7860

Issue

Section

AAAI Technical Track: Knowledge Representation and Reasoning