Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 24 (2014): Issue 2 (June 2014)
Open Access
Selection of search strategies for solving 3-SAT problems
Andrzej Pułka
Andrzej Pułka
| Jun 26, 2014
International Journal of Applied Mathematics and Computer Science
Volume 24 (2014): Issue 2 (June 2014)
Signals and Systems (special section, pp. 233-312), Ryszard Makowski and Jan Zarzycki (Eds.)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Jun 26, 2014
Page range:
283 - 297
Received:
Jan 13, 2013
DOI:
https://doi.org/10.2478/amcs-2014-0021
Keywords
SAT solving
,
formal verification
,
CNF
,
Boolean satisfiability
© 2014 Andrzej Pułka
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
Andrzej Pułka
Institute of Electronics Silesian University of Technology, ul. Akademicka 16, 44-100 Gliwice, Poland