A BDD-Based Simplification and Skolemization Procedure
暂无分享,去创建一个
[1] B. Dreben,et al. The decision problem: Solvable classes of quantificational formulas , 1979 .
[2] Bernhard Beckert,et al. The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux , 1993, Kurt Gödel Colloquium.
[3] Joachim Posegga,et al. Deduktion mit Shannongraphen für Prädikatenlogik erster Stufe , 1993, DISKI.
[4] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[5] Anthony C. Hearn,et al. REDUCE 2: A system and language for algebraic manipulation , 1971, SYMSAC '71.
[6] Alexander Leitsch,et al. On Skolemization and Proof Complexity , 1994, Fundam. Informaticae.
[7] Jean Goubault. HimML: Standard ML with Fast Sets and Maps , 1994 .
[8] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.
[9] François Bry,et al. SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.
[10] E BryantRandal. Graph-Based Algorithms for Boolean Function Manipulation , 1986 .
[11] Peter B. Andrews. An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.
[12] Thierry Boy de la Tour. Minimizing the Number of Clauses by Renaming , 1990, CADE.