Reasoning as Axioms Change - Incremental View Maintenance Reconsidered.

RR'11: Proceedings of the 5th international conference on Web reasoning and rule systems(2011)

引用 9|浏览4
暂无评分
摘要
We present a novel incremental algorithm to compute changes to materialized views in logic databases like those used by rule-based reasoners. Such reasoners have to address the problem of changing axioms in the presence of materializations of derived atoms. Existing approaches have drawbacks: some require to generate and evaluate large transformed programs that are in Datalog while the source program is in Datalog and significantly smaller; some recompute the whole extension of a predicate even if only a small part of this extension is affected by the change. The method presented in this article overcomes both drawbacks, arguably at an acceptable price: a slight adaptation of the semi-naïve forward chaining.
更多
查看译文
关键词
whole extension,acceptable price,logic databases,novel incremental algorithm,rule-based reasoner,slight adaptation,small part,source program,axioms change,incremental view maintenance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要