Splitting Through New Proposition Symbols
暂无分享,去创建一个
[1] Christoph Weidenbach,et al. Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.
[2] Hans de Nivelle,et al. A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality , 2001, IJCAR.
[3] Christoph Weidenbach,et al. On Generating Small Clause Normal Forms , 1998, CADE.
[4] Harald Ganzinger,et al. A superposition decision procedure for the guarded fragment with equality , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[5] Christian G. Fermüller,et al. A non-elementary speed-up in proof length by structural clause form transformation , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[6] Harald Ganzinger,et al. Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.
[7] Hans de Nivelle. Deciding the E+ - class by an a posteriori, liftable order , 2000, Ann. Pure Appl. Log..
[8] Hans de Nivelle. Resolution Games and Non-Liftable Resolution Orderings , 1994, CSL.
[9] Ullrich Hustadt,et al. Resolution-Based Methods for Modal Logics , 2000, Log. J. IGPL.
[10] Andrei Voronkov,et al. Splitting Without Backtracking , 2001, IJCAI.
[11] Christian G. Fermüller,et al. Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.