作者: Raphael Volz , Steffen Staab , Boris Motik
DOI: 10.1007/978-3-540-30567-5_1
关键词:
摘要: This article presents a technique to incrementally maintain materializations of ontological entailments. Materialization consists in precomputing and storing set implicit entailments, such that frequent and/or crucial queries the ontology can be solved more efficiently. The central problem arises with materialization is its maintenance when axioms change, viz. process propagating changes explicit stored entailments. When considering rule-enabled languages are operationalized logic databases, we distinguish two types changes. Changes will typically manifest themselves rules program, whereas facts lead extensions logical predicates. incremental latter type has been studied extensively deductive database context apply proposed [30] for our purpose. former has, however, not tackled before. In this elaborate on previous papers [32, 33], which extend approach deal program. Our limited particular language but generally applied arbitrary translated Datalog programs, i.e. as O-Telos, F-Logic [16] RDF(S), or Description Logic Programs [34].