OntoRevision: A Plug-in System for Ontology Revision in Protégé

Cobby, Nathan; Wang, Kewen; Wang, Zhe; Sotomayor, Marco

doi:10.1007/978-3-642-29923-0_32

Cited by 2 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is not surprising, as even in the case of propositional logic, the size of the revision (under Satoh's revision operator in particular) is not polynomial in the size of the input, unless the polynomial hierarchy collapses [Cadoli et al 1999]. While some other optimization techniques have been developed in a prototype implementation [Cobby et al 2011] as a plug-in of Protégé, the algorithm is still not very efficient at this moment and thus one future issue would be developing more efficient algorithms for our revision operators.…”

Section: A:29mentioning

confidence: 99%

DL-Lite Ontology Revision Based on An Alternative Semantic Characterization

Wang

Topor

2015

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

Ontology engineering and maintenance require (semi-)automated ontology change operations. Intensive research has been conducted on TBox and ABox changes in description logics (DLs), and various change operators have been proposed in the literature. Existing operators largely fall into two categories: syntax-based and model-based. While each approach has its advantages and disadvantages, an important topic that has been rarely explored is how to achieve a balance between syntax-based and model-based approaches. Also, most existing operators are specially designed for either TBox change or ABox change, and cannot handle the general ontology revision task-Given a DL knowledge base (KB, a pair of a TBox and an ABox), how to revise it by a set of TBox and ABox axioms (i.e., a new DL KB). In this paper, we introduce an alternative structure for DL-Lite, called a featured interpretation, and show that featured models provide a finite and tight characterization to the classical semantics of DL-Lite. A key issue for defining a change operator is the so-called expressibility, that is, whether a set of models (or featured models here) is axiomatizable in DLs. It is indeed much easier to obtain expressibility results for featured models than for classical DL models. As a result, the new semantics determined by featured models provides a method for defining and studying various changes of DL-Lite KBs that involve both TBoxes and ABoxes. To demonstrate the usefulness of the new semantic characterization in ontology change, we define two revision operators for DL-Lite KBs using featured models and study their properties. In particular, we show that our two operators both satisfy AGM postulates. We show that the complexity of our revisions is Π P 2-complete, that is, on the same level as major revision operators in propositional logic, which further justifies the feasibility of our revision approach for DL-Lite. Also, we develop algorithms for these DL-Lite revisions.

show abstract

Section: A:29mentioning

confidence: 99%