Proving Finite Satisfiability of Deductive Databases
Proving Finite Satisfiability of Deductive Databases
复制标题
证明演绎数据库的有限可满足性
DOI：
--
复制
发表时间：
1987
期刊：
影响因子：
--
通讯作者：
R. Manthey
中科院分区：
文献类型：
--
作者：
François Bry;R. Manthey
证明了某些反驳方法可以推广为对不可满足性和有限可满足性都完全的半决策过程。提出的推广是由有限可满足性的一个新的表征来证明的。本研究的动机是一个数据库设计问题：确定数据库中的演绎规则和完整性约束必须是有限可满足的。
It is shown how certain refutation methods can be extended into semi-decision procedures that are complete for both unsatisfiability and finite satisfiability. The proposed extension is justified by a new characterization of finite satisfiability. This research was motivated by a database design problem: Deduction rules and integrity constraints in definite databases have to be finitely satisfiable.