Author:
Zhong Xiaomei,Xu Yang,Liu Jun,Chen Shuwei
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference50 articles.
1. Aguilera G, de Guzmán L, Ojeda-Aciego M, Valverde A (2001) Reductions for non-clausal theorem proving. Theor Comput Sci 266:81–112
2. Baaz M, Fermüller CG (1995) Resolution-based theorem proving for many-valued logics. J Symbol Comput 19:353–391
3. Baaz M, Leitsch A (1992) Complexity of resolution proofs and function introduction. Ann Pure Appl Logic 57:181–215
4. Dubois D, Prade H (1990) Resolution principle in possibilistic logic. Int J Approx Reason 4(1):1–21
5. Dubois D, Lang J, Prade H (1987) Theorem proving under uncertainty—a possibility theory based approach. In: Proceedings of the international joint conference on artificial intelligence (IJCAI’87), Milano, Italy, pp 984–986
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献