在析取演绎数据库中只计算最小答案
Computing only minimal answers in disjunctive deductive databases
摘要：
提出了一种在析取稳定模型语义下计算析取演绎数据库中最小答案的方法。这样的答案是通过反复扩展部分答案来构造的。我们的方法是完整的（在每一个最小的答案可以计算），并不承认冗余（在这个意义上说，每一个部分的答案生成可以扩展到一个最小的答案），因此没有非最小的答案生成。对于分层数据库，该方法不（必须）需要计算数据库的模型的整体。编译被提出作为一种工具，通过它可以克服有关的计算效率和不存在的析取稳定模型的问题。我们的方法扩展到其他语义也被认为是。
英文摘要：
A method is presented for computing minimal answers in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every minimal answer can be computed) and does not admit redundancy (in the sense that every partial answer generated can be extended to a minimal answer), whence no non-minimal answer is generated. For stratified databases, the method does not (necessarily) require the computation of models of the database in their entirety. Compilation is proposed as a tool by which problems relating to computational efficiency and the non-existence of disjunctive stable models can be overcome. The extension of our method to other semantics is also considered.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
