메뉴 건너뛰기




Volumn , Issue , 2005, Pages 290-295

Mapping many-valued CNF formulas to Boolean CNF formulas

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; ENCODING (SYMBOLS); MAPPING; PROBLEM SOLVING;

EID: 24644465658     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (9)
  • 2
    • 0032678061 scopus 로고    scopus 로고
    • Transformations between signed and classical clause logic
    • IEEE Press, Los Alamitos
    • B. Beckert, R. Hähnle, and F. Manyà. Transformations between signed and classical clause logic. In Proceedings of ISMVL'99, Freiburg, Germany, pages 248-255. IEEE Press, Los Alamitos, 1999.
    • (1999) Proceedings of ISMVL'99, Freiburg, Germany , pp. 248-255
    • Beckert, B.1    Hähnle, R.2    Manyà, F.3
  • 3
    • 0034822262 scopus 로고    scopus 로고
    • A modular reduction of regular logic to classical logic
    • IEEE CS Press, Los Alamitos
    • R. Béjar, R. Hähnle, and F. Manyà. A modular reduction of regular logic to classical logic. In Proceedings of ISMVL-2001, Warsaw, Poland, pages 221-226. IEEE CS Press, Los Alamitos, 2001.
    • (2001) Proceedings of ISMVL-2001, Warsaw, Poland , pp. 221-226
    • Béjar, R.1    Hähnle, R.2    Manyà, F.3
  • 4
    • 84880872693 scopus 로고    scopus 로고
    • Solving non-boolean satisfiability problems with stochastic local search
    • A. M. Frisch and T. J. Peugniez. Solving non-boolean satisfiability problems with stochastic local search. In Proceedings of IJCAI-2001, pages 282-288, 2001.
    • (2001) Proceedings of IJCAI-2001 , pp. 282-288
    • Frisch, A.M.1    Peugniez, T.J.2
  • 5
    • 22544450718 scopus 로고    scopus 로고
    • Advanced many-valued logic
    • D. Gabbay and F. Guenthner, editors, Kluwer, second edition
    • R. Hähnle. Advanced many-valued logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2. Kluwer, second edition, 2001.
    • (2001) Handbook of Philosophical Logic , vol.2
    • Hähnle, R.1
  • 6
    • 0003367110 scopus 로고    scopus 로고
    • The 2-SAT problem in signed CNF formulas
    • F. Manyà. The 2-SAT problem in signed CNF formulas. Multiple-Valued Logic, 5(4):307-325, 2000.
    • (2000) Multiple-valued Logic , vol.5 , Issue.4 , pp. 307-325
    • Manyà, F.1
  • 8
    • 0030105626 scopus 로고    scopus 로고
    • Locating the phase transition in binary constraint satisfaction problems
    • B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:155-181, 1996.
    • (1996) Artificial Intelligence , vol.81 , pp. 155-181
    • Smith, B.1    Dyer, M.2
  • 9
    • 84897712733 scopus 로고    scopus 로고
    • SAT v CSP
    • Singapore, Springer LNCS 1894
    • T. Walsh. SAT v CSP. In Proceedings of CP-2000, Singapore, pages 441-456. Springer LNCS 1894, 2000.
    • (2000) Proceedings of CP-2000 , pp. 441-456
    • Walsh, T.1


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