메뉴 건너뛰기




Volumn , Issue , 2003, Pages 84-93

MFSAT: A SAT Solver Using Multi-Flip Local Search

Author keywords

[No Author keywords available]

Indexed keywords

MULTI-FLIP PROCEDURES; PROPOSITIONAL SATISFIABILITY (SAT);

EID: 0344666764     PISSN: 10636730     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (14)
  • 1
    • 0027632544 scopus 로고
    • Local search for satisfiability (SAT) problem
    • July/August
    • Jun Gu, Local search for satisfiability (SAT) problem, IEEE Transactions on systems, man, and cybernetics, Vol. 23, No. 4, July/August 1993, pp. 1108-1129.
    • (1993) IEEE Transactions on Systems, Man, and Cybernetics , vol.23 , Issue.4 , pp. 1108-1129
    • Gu, J.1
  • 6
    • 44049112032 scopus 로고
    • Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
    • Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58, 1992, pp. 161-205.
    • (1992) Artificial Intelligence , vol.58 , pp. 161-205
    • Minton, S.1    Johnston, M.D.2    Philips, A.B.3    Laird, P.4
  • 11
    • 0036669185 scopus 로고    scopus 로고
    • On the hybrid prepositional encodings of planning
    • Amol Dattatraya Mali, On the hybrid prepositional encodings of planning, Computational Intelligence journal, Vol. 18, No. 3, 2002, pp. 386-419.
    • (2002) Computational Intelligence Journal , vol.18 , Issue.3 , pp. 386-419
    • Mali, A.D.1


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