Solving SAT by algorithm transform of Wu’s method-Reference-Cited by-同舟云学术

Solving SAT by algorithm transform of Wu’s method

Published:1999-09 Issue:5 Volume:14 Page:468-480
ISSN:1000-9000
Container-title:Journal of Computer Science and Technology
language:en
Short-container-title:J. Comput. Sci. & Technol.

Author:

He Simin,Zhang Bo

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02948788.pdf

Reference11 articles.

1. Davis M, Logemann G, Loveland D. A machine program for theorem proving.Communications of the ACM, 1962, 5: 394–397.

2. Robinson J A. A machine-oriented logic based on the resolution principle.Journal of the ACM, 1965, 12(1): 23–41.

3. Wu W. Basic principles of mechanical theorem proving in geometries.,Journal of Automated Reasoning, 1986, 2: 221–252.

4. Kapur D, Kakshman Y N. Elimination Theory: An Introduction. Chapter 2 in Symbolic and Numerical Computation for Artificial Intelligence, Academic Press, 1992.

5. He Simin. The Design and Analysis of Algorithms for Satisfiability Problem. Ph.D. dissertation, Department of Computer Science and Technology, Tsinghua University, 1997.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Time-Free Solution to SAT Problem by Tissue P Systems;Mathematical Problems in Engineering;2017

2. Solving All‐SAT Problems by P Systems;Chinese Journal of Electronics;2015-10

3. A characteristic set method for solving boolean equations and applications in cryptanalysis of stream ciphers*;Journal of Systems Science and Complexity;2008-02

4. Automated Reasoning and Equation Solving with the Characteristic Set Method;Journal of Computer Science and Technology;2006-09