Abstract Model Generation for Preprocessing Clause Sets
暂无分享,去创建一个
[1] G Sutcliffe,et al. The practice of clausification in automatic theorem proving , 1996 .
[2] Miyuki Koshimura,et al. Proof Simplification for Model Generation and Its Applications , 2000, LPAR.
[3] Geoff Sutcliffe,et al. The CADE ATP System Competition , 2004, IJCAR.
[4] Earl D. Sacerdoti,et al. Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.
[5] Marc Fuchs,et al. Abstraction-Based Relevancy Testing for Model Elimination , 1999, CADE.
[6] François Bry,et al. SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.
[7] David A. Plaisted,et al. Theorem Proving with Abstraction , 1981, Artif. Intell..
[8] Geoff Sutcliffe,et al. The TPTP Problem Library , 1994, Journal of Automated Reasoning.
[9] Stephan Schulz,et al. E - a brainiac theorem prover , 2002, AI Commun..
[10] François Bry,et al. Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation , 2004, Journal of Automated Reasoning.
[11] Fausto Giunchiglia,et al. A Theory of Abstraction , 1992, Artif. Intell..
[12] Qiang Yang,et al. Characterizing Abstraction Hierarchies for Planning , 1991, AAAI.
[13] David A. Plaisted,et al. A relevance restriction strategy for automated deduction , 2003, Artif. Intell..
[14] Andrei Voronkov,et al. The design and implementation of VAMPIRE , 2002, AI Commun..
[15] Gernot Stenz. DCTP 1.2 - System Abstract , 2002, TABLEAUX.