Abstract
Recently a randomized algorithm based on Davis and Putnam Procedure was designed in [16] for the purpose of solving the satisfiabilty problem. In this letter another Monte Carlo algorithm following from an original algorithm [4] is proposed. The average performance of the algorithm is polynomial and the probability that the algorithm fails to yield a correct answer for some data is less than e. Results are compared with those given in [16] and show an interesting performance for our algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.A. Cook. An overview of computational complexity. Communication of the ACM. 26, 6(1983)
M. Davis and H. Putnam. A computing procedure for quantification theory. J Assoc Comput Mach 7 (1960) 202–215
H. Drias. Number of Solutions for SAT instances: A Probability Distribution Study. J info Science and Engineering 8, 4 (1992) 621–631
H. Drias. A new algorithm for counting and checking satisfiability problem and a restricted unfavorable region for polynomial average time. in proc of the 30th IEEE Symposium on System Theory (1998)
O. Dubois and J. Carlier. Probabilistic approach to the satisfiability problem. Theor Comp Sci 81 (1991) 65–76
J. Franco. On the probabilistic performance of algorithms for the satisfiability problem. Info Proc Let 23 (1986) 103–106.
J. Franco and Y.C. Ho. Probabilistic performance of heuristic for the satisfiability problem. Discrete Appl Math 22 (1988/1989) 35–51
M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman & C. 1979.
A. Goldberg. Average case complexity of the satisfiability problem. in proc. Fourth workshop on Automated deduction (1979) 1–6
A. Goldberg, P.W. Purdom and C.A. Brown. Average time analyses of simplified Davis-Putnam procedures. Info Proc let 15 (1982)72–75
K. Iwama. CNF satisfiability test by counting and polynomial average time. SIAM J Comp 18, 2 (1989) 385–391
P. Purdom. Search rearrangement backtracking and polynomial average time. Artificial Intelligence 21 (1983) 117–133
P. Purdom and C.A. Brown. Polynomial average time satisfiability problem. Info Sci 41 (1987) 23–42
P. Purdom and C.A. Brown. The pure literal rule and polynomial average time. SIAM J Comp 14 (1985) 943–953
R. Solovay and V.A. Strassen. A fast Monte Carlo test for primality. SIAM J. Comput 6 (1977) 84–8
L.C. Wu and C.Y. Tang. Solving the satisfiability problem by using randomized approach. Info Proc Let 41 (1992)187–190
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Drias, H. (1998). A Monte Carlo algorithm for the satisfiability problem. In: Mira, J., del Pobil, A.P., Ali, M. (eds) Methodology and Tools in Knowledge-Based Systems. IEA/AIE 1998. Lecture Notes in Computer Science, vol 1415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64582-9_745
Download citation
DOI: https://doi.org/10.1007/3-540-64582-9_745
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64582-5
Online ISBN: 978-3-540-69348-2
eBook Packages: Springer Book Archive