Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
暂无分享,去创建一个
[1] James R. Slagle,et al. Automatic Theorem Proving With Renamable and Semantic Resolution , 1967, JACM.
[2] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[3] Harald Ganzinger,et al. On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.
[4] Harald Ganzinger,et al. Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..
[5] Zohar Manna,et al. A Deductive Approach to Program Synthesis , 1979, TOPL.
[6] David A. Plaisted,et al. A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..
[7] James R. Slagle,et al. Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity , 1974, JACM.
[8] Larry Wos,et al. Automated reasoning - 33 basic research problems , 1988 .
[9] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..
[10] Neil V. Murray. Completely Non-Clausal Theorem Proving , 1982, Artif. Intell..