PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
暂无分享,去创建一个
[1] Joseph Douglas Horton. Sub-Latin Squares and Incomplete Orthogonal Arrays , 1974, J. Comb. Theory, Ser. A.
[2] John N. Hooker,et al. Solving the incremental satisfiability problem , 1993, J. Log. Program..
[3] A. S. Hedayat,et al. On the theory and application of sum composition of Latin squares and orthogonal Latin squares. , 1974 .
[4] J. N. Hooker,et al. Solving the Incremental Satissability Problem , 1992 .
[5] W. McCune. A Davis-Putnam program and its application to finite-order model search: Quasigroup existence problems , 1994 .
[6] Hansong Zhang,et al. Implementing the Davis-Putnam Algorithm by Tries , 1994 .
[7] Hantao Zhang. Solving Open Quasigroup Problems by Propositional Reasoning , 1994 .
[8] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[9] M. Bonacina,et al. Cumulating search in a distributed computing environment: a case study in parallel satisfiability , 1994 .
[10] Douglas R Stinson,et al. Contemporary design theory : a collection of surveys , 1992 .
[11] Masayuki Fujita,et al. Automatic Generation of Some Results in Finite Algebra , 1993, IJCAI.
[12] M. Stickel,et al. Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .
[13] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[14] J. Hooker,et al. Branching Rules for Satissability , 1995 .