Labelled Splitting
暂无分享,去创建一个
[1] Christoph Weidenbach,et al. Labelled Clauses , 2007, CADE.
[2] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.
[3] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[4] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[5] Christoph Weidenbach,et al. System Description: SpassVersion 3.0 , 2007, CADE.
[6] Geoff Sutcliffe,et al. The TPTP Problem Library , 1994, Journal of Automated Reasoning.
[7] Albert Rubio,et al. Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.
[8] Harald Ganzinger,et al. Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.
[9] Christoph Weidenbach,et al. SPASS & FLOTTER Version 0.42 , 1996, CADE.
[10] Tobias Nipkow,et al. Term rewriting and all that , 1998 .
[11] Harald Ganzinger,et al. Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality , 1993, Kurt Gödel Colloquium.
[12] Andrei Voronkov,et al. Splitting Without Backtracking , 2001, IJCAI.
[13] Christoph Weidenbach,et al. Combining Superposition, Sorts and Splitting , 2001, Handbook of Automated Reasoning.