메뉴 건너뛰기




Volumn 20, Issue 1-4, 1997, Pages 357-391

Average case results for satisfiability algorithms under the random-clause-width model

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0031478062     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018992730285     Document Type: Article
Times cited : (6)

References (25)
  • 1
    • 0018454769 scopus 로고
    • Fast probabilistic algorithms for Hamiltonian circuits and matchings
    • D. Angluin and L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Journal of Comput. Sys. Sci. 18 (1979) 155-193.
    • (1979) Journal of Comput. Sys. Sci. , vol.18 , pp. 155-193
    • Angluin, D.1    Valiant, L.G.2
  • 3
    • 0024646562 scopus 로고
    • Exponential average time for the pure literal rule
    • K. Bugrara, Y. Pan and P.W. Purdom, Exponential average time for the pure literal rule, SIAM J. Comput. 18 (1989) 409-418.
    • (1989) SIAM J. Comput. , vol.18 , pp. 409-418
    • Bugrara, K.1    Pan, Y.2    Purdom, P.W.3
  • 4
    • 0025750713 scopus 로고
    • Extended Horn sets in propositional logic
    • V. Chandru and J.N. Hooker, Extended Horn sets in propositional logic, J. ACM 38 (1991) 205-221.
    • (1991) J. ACM , vol.38 , pp. 205-221
    • Chandru, V.1    Hooker, J.N.2
  • 5
    • 84881072062 scopus 로고
    • A computing procedure for quantification theory
    • M. Davis and H. Putnam, A computing procedure for quantification theory, J. ACM 7 (1960) 201-215.
    • (1960) J. ACM , vol.7 , pp. 201-215
    • Davis, M.1    Putnam, H.2
  • 6
    • 84919401135 scopus 로고
    • A machine program for theorem proving
    • M. Davis, G. Logemann and D. Loveland, A machine program for theorem proving, C. ACM 5 (1962) 394-397.
    • (1962) C. ACM , vol.5 , pp. 394-397
    • Davis, M.1    Logemann, G.2    Loveland, D.3
  • 7
    • 0021509216 scopus 로고
    • Linear time algorithms for testing the satisfiability of Horn formulae
    • W.F. Dowling and J.H. Gallier, Linear time algorithms for testing the satisfiability of Horn formulae, J. Logic Prog. 3 (1984) 267-284.
    • (1984) J. Logic Prog. , vol.3 , pp. 267-284
    • Dowling, W.F.1    Gallier, J.H.2
  • 8
    • 38249004400 scopus 로고
    • On the occurrence of null clauses in random instances of satisfiability
    • J. Franco, On the occurrence of null clauses in random instances of satisfiability, Discrete Appl. Math. 41 (1993) 203-209.
    • (1993) Discrete Appl. Math. , vol.41 , pp. 203-209
    • Franco, J.1
  • 9
    • 0026371511 scopus 로고
    • Elimination of infrequent variables improves average case performance of satisfiability algorithms
    • J. Franco, Elimination of infrequent variables improves average case performance of satisfiability algorithms, SIAM Journal on Computing 20 (1991) 1119-1127.
    • (1991) SIAM Journal on Computing , vol.20 , pp. 1119-1127
    • Franco, J.1
  • 10
    • 0042157138 scopus 로고
    • Probabilistic analysis of algorithms for stuck-at test generation in PLAs
    • J. Franco, Probabilistic analysis of algorithms for stuck-at test generation in PLAs, Lecture Notes in Control and Information Sciences 174 (1992) 56-75.
    • (1992) Lecture Notes in Control and Information Sciences , vol.174 , pp. 56-75
    • Franco, J.1
  • 11
    • 0024142556 scopus 로고
    • Probabilistic analysis of a heuristic for the satisfiability problem
    • J. Franco and Y.C. Ho, Probabilistic analysis of a heuristic for the satisfiability problem, Discrete Applied Math. 22 (1988/1989) 35-51.
    • (1988) Discrete Applied Math. , vol.22 , pp. 35-51
    • Franco, J.1    Ho, Y.C.2
  • 12
    • 0019346375 scopus 로고
    • Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem
    • J. Franco and M. Paull, Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem, Discrete Appl. Math. 5 (1983) 77-87.
    • (1983) Discrete Appl. Math. , vol.5 , pp. 77-87
    • Franco, J.1    Paull, M.2
  • 13
    • 0024701533 scopus 로고
    • Algorithms for testing the satisfiability of propositional formulae
    • G. Gallo and G. Urbani, Algorithms for testing the satisfiability of propositional formulae, J. Logic Prog. 7 (1989) 45-61.
    • (1989) J. Logic Prog. , vol.7 , pp. 45-61
    • Gallo, G.1    Urbani, G.2
  • 15
    • 0020476233 scopus 로고
    • Average time analysis of simplified Davis-Putnam procedures
    • A. Goldberg, P.W. Purdom and C.A. Brown, Average time analysis of simplified Davis-Putnam procedures, Inform. Process. Lett. 15 (1982) 72-75.
    • (1982) Inform. Process. Lett. , vol.15 , pp. 72-75
    • Goldberg, A.1    Purdom, P.W.2    Brown, C.A.3
  • 16
    • 0024647467 scopus 로고
    • CNF satisfiability test by counting and polynomial average time
    • K. Iwama, CNF satisfiability test by counting and polynomial average time, SIAM J. Comput. 18 (1989) 385-391.
    • (1989) SIAM J. Comput. , vol.18 , pp. 385-391
    • Iwama, K.1
  • 17
    • 0041547074 scopus 로고
    • Technical Report 243, Department of Computer Science, Israel Institute of Technology
    • A. Itai and J. Makowsky, On the complexity of Herbrand's theorem, Technical Report 243, Department of Computer Science, Israel Institute of Technology (1982).
    • (1982) On the Complexity of Herbrand's Theorem
    • Itai, A.1    Makowsky, J.2
  • 18
    • 84976816031 scopus 로고
    • Renaming a set of clauses as a Horn set
    • H.R. Lewis, Renaming a set of clauses as a Horn set, J. ACM 25 (1978) 134-135.
    • (1978) J. ACM , vol.25 , pp. 134-135
    • Lewis, H.R.1
  • 19
    • 0025555090 scopus 로고
    • A survey of average time analysis of satisfiability algorithms
    • P.W. Purdom, A survey of average time analysis of satisfiability algorithms, Journal of Information Processing 13 (1990).
    • (1990) Journal of Information Processing , vol.13
    • Purdom, P.W.1
  • 20
    • 0020717889 scopus 로고
    • Search rearrangement backtracking and polynomial average time
    • P.W. Purdom, Search rearrangement backtracking and polynomial average time, Artificial Intelligence 21 (1983) 117-133.
    • (1983) Artificial Intelligence , vol.21 , pp. 117-133
    • Purdom, P.W.1
  • 21
    • 0043158766 scopus 로고
    • The pure literal rule and polynomial average time
    • P.W. Purdom and C.A. Brown, The pure literal rule and polynomial average time, SIAM J. Comput. 14 (1985) 943-953.
    • (1985) SIAM J. Comput. , vol.14 , pp. 943-953
    • Purdom, P.W.1    Brown, C.A.2
  • 22
    • 0023293340 scopus 로고
    • Polynomial average time satisfiability problems
    • P.W. Purdom and C.A. Brown, Polynomial average time satisfiability problems, Inform. Sci. 41 (1987) 23-42.
    • (1987) Inform. Sci. , vol.41 , pp. 23-42
    • Purdom, P.W.1    Brown, C.A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.