首页 | 本学科首页   官方微博 | 高级检索  
     


Proof Complexity of Modal Resolution
Authors:Sigley  Sarah  Beyersdorff  Olaf
Affiliation:1.School of Computing, University of Leeds, Leeds, UK
;2.Institute of Computer Science, Friedrich Schiller University Jena, Jena, Germany
;
Abstract:Journal of Automated Reasoning - We investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3–4):117–134, 2007) and Nalon et al. (in:...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号