{log}: a language for programming in logic with finite sets

被引：0
|
作者：
Universita di Parma, Parma, Italy [1 ]
机构：
来源：
J Logic Program | / 1卷 / 1-44期
关键词：
PROOF OF THEOREM 5.6. If P ~set (-~G~) v; then P U {(G~) v} is unsatisfiable. Let V be a ground substitution acting on the (free) variables of G ~. Then P U {G ~°~ } is unsatisfiable. By Lemma 5.5; there exists a refutation for G °°7 in P and; therefore; by Lemma 5.3; G has a refutation in P. [] This work originated from a project named AXL; funded by ENI and ENIDATA; Partial support came from the Italian National Research Council (CNR grants 94.00472.CT12 and 95.00502.CT12) and from Compulog-2 (Esprit project 6810). Enrico Pontelli was partially supported by NSF Grant CCR 92-11732 and by a fellowship from Phillips Petroleum;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
55
引用
收藏
相关论文
共 50 条
12345