-
1
-
-
35248813309
-
Boosting chaff's performance by incorporating CSP heuristics
-
Springer LNCS 2833
-
C. Ansótegui, J. Larrubia, and F. Manyà. Boosting Chaff's performance by incorporating CSP heuristics. In Proceedings of CP-2003, Kinsale, Ireland, pages 96-107. Springer LNCS 2833, 2003.
-
(2003)
Proceedings of CP-2003, Kinsale, Ireland
, pp. 96-107
-
-
Ansótegui, C.1
Larrubia, J.2
Manyà, F.3
-
2
-
-
0032678061
-
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
-
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
-
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
-
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
-
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
-
7
-
-
0034852165
-
Chaff: Engineering an efficient SAT solver
-
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 39th Design Automation Conference, 2001.
-
(2001)
39th Design Automation Conference
-
-
Moskewicz, M.1
Madigan, C.2
Zhao, Y.3
Zhang, L.4
Malik, S.5
-
8
-
-
0030105626
-
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
-
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
|