-
1
-
-
9444228195
-
Modeling choices in quasigroup completion: Sat vs. CSP
-
McGuinness, D. L., & Ferguson, G. (Eds.) San Jose, California, USA. AAAI Press / The MIT Press
-
Ansótegui, C., del Val, A., Dotú, I., Fernández, C., & Manyà, F. (2004). Modeling choices in quasigroup completion: SAT vs. CSP. In McGuinness, D. L., & Ferguson, G. (Eds.), AAAI, pp. 137-142, San Jose, California, USA. AAAI Press / The MIT Press.
-
(2004)
AAAI
, pp. 137-142
-
-
Ansótegui, C.1
Del Val, A.2
Dotú, I.3
Fernández, C.4
Manyà, F.5
-
2
-
-
79960050788
-
Cardinality networks: A theoretical and empirical study
-
Asín, R., Nieuwenhuis, R., Oliveras, A., & Rodríguez-Carbonell, E. (2011). Cardinality networks: a theoretical and empirical study. Constraints, 16(2), 195-221.
-
(2011)
Constraints
, vol.16
, Issue.2
, pp. 195-221
-
-
Asín, R.1
Nieuwenhuis, R.2
Oliveras, A.3
Rodríguez-Carbonell, E.4
-
3
-
-
84958958122
-
Factorizing equivalent variable pairs in ROBDD-based implementations of pos
-
Haeberer, A. M. (Ed.) Amazonia, Brasil, January 4-8, 1999, Proceedings, Vol. 1548 of Lecture Notes in Computer Science
-
Bagnara, R., & Schachte, P. (1998). Factorizing equivalent variable pairs in ROBDD-based implementations of Pos. In Haeberer, A. M. (Ed.), Algebraic Methodology and Software Technology, 7th International Conference, AMAST '98, Amazonia, Brasil, January 4-8, 1999, Proceedings, Vol. 1548 of Lecture Notes in Computer Science, pp. 471-485.
-
(1998)
Algebraic Methodology and Software Technology, 7th International Conference, AMAST '98
, pp. 471-485
-
-
Bagnara, R.1
Schachte, P.2
-
4
-
-
33646203802
-
Efficient CNF encoding of boolean cardinality constraints
-
Rossi, F. (Ed.) Kinsale, Ireland. Springer
-
Bailleux, O., & Boufkhad, Y. (2003). Efficient CNF encoding of Boolean cardinality constraints. In Rossi, F. (Ed.), CP, Vol. 2833 of LNCS, pp. 108-122, Kinsale, Ireland. Springer.
-
(2003)
CP, Vol. 2833 of LNCS
, pp. 108-122
-
-
Bailleux, O.1
Boufkhad, Y.2
-
6
-
-
85154002090
-
Sorting networks and their applications
-
Atlantic City, NJ, USA. Thomson Book Company, Washington D.C
-
Batcher, K. E. (1968). Sorting networks and their applications. In AFIPS Spring Joint Computing Conference, Vol. 32 of AFIPS Conference Proceedings, pp. 307-314, Atlantic City, NJ, USA. Thomson Book Company, Washington D.C.
-
(1968)
AFIPS Spring Joint Computing Conference, Vol. 32 of AFIPS Conference Proceedings
, pp. 307-314
-
-
Batcher, K.E.1
-
7
-
-
78149247227
-
Circuit complexity and decompositions of global constraints
-
Bessiere, C., Katsirelos, G., Narodytska, N., & Walsh, T. (2009). Circuit complexity and decompositions of global constraints. In Proceedings of IJCAI 2009, pp. 412-418.
-
(2009)
Proceedings of IJCAI 2009
, pp. 412-418
-
-
Bessiere, C.1
Katsirelos, G.2
Narodytska, N.3
Walsh, T.4
-
8
-
-
11144320708
-
Compiling problem specifications into SAT
-
Cadoli, M., & Schaerf, A. (2005). Compiling problem specifications into SAT. Artificial Intelligence, 162 (1-2), 89-120.
-
(2005)
Artificial Intelligence
, vol.162
, Issue.1-2
, pp. 89-120
-
-
Cadoli, M.1
Schaerf, A.2
-
9
-
-
79953225926
-
Optimal base encodings for pseudo-boolean constraints
-
Abdulla, P. A., & Leino, K. R. M. (Eds.) Springer
-
Codish, M., Fekete, Y., Fuhs, C., & Schneider-Kamp, P. (2011). Optimal base encodings for pseudo-Boolean constraints. In Abdulla, P. A., & Leino, K. R. M. (Eds.), TACAS, Vol. 6605 of Lecture Notes in Computer Science, pp. 189-204. Springer.
-
(2011)
TACAS, Vol. 6605 of Lecture Notes in Computer Science
, pp. 189-204
-
-
Codish, M.1
Fekete, Y.2
Fuhs, C.3
Schneider-Kamp, P.4
-
10
-
-
36849050713
-
Logic programming with satisfiability
-
Codish, M., Lagoon, V., & Stuckey, P. J. (2008). Logic programming with satisfiability. TPLP, 8(1), 121-128.
-
(2008)
TPLP
, vol.8
, Issue.1
, pp. 121-128
-
-
Codish, M.1
Lagoon, V.2
Stuckey, P.J.3
-
11
-
-
78650817430
-
Pairwise cardinality networks
-
Clarke, E. M., & Voronkov, A. (Eds.) Springer
-
Codish, M., & Zazon-Ivry, M. (2010). Pairwise cardinality networks. In Clarke, E. M., & Voronkov, A. (Eds.), LPAR (Dakar), Vol. 6355 of Lecture Notes in Computer Science, pp. 154-172. Springer.
-
(2010)
LPAR (Dakar), Vol. 6355 of Lecture Notes in Computer Science
, pp. 154-172
-
-
Codish, M.1
Zazon-Ivry, M.2
-
12
-
-
0025556059
-
A unified framework for the formal verification of sequential circuits
-
Coudert, O., & Madre, J. C. (1990). A unified framework for the formal verification of sequential circuits. In ICCAD, pp. 126-129.
-
(1990)
ICCAD
, pp. 126-129
-
-
Coudert, O.1
Madre, J.C.2
-
13
-
-
0028603245
-
Experimental results on the application of satisfiability algorithms to scheduling problems
-
Hayes-Roth, B., & Korf, R. E. (Eds.) Seattle, WA, USA. AAAI Press / The MIT Press
-
Crawford, J. M., & Baker, A. B. (1994). Experimental results on the application of satisfiability algorithms to scheduling problems. In Hayes-Roth, B., & Korf, R. E. (Eds.), AAAI, Vol. 2, pp. 1092-1097, Seattle, WA, USA. AAAI Press / The MIT Press.
-
(1994)
AAAI
, vol.2
, pp. 1092-1097
-
-
Crawford, J.M.1
Baker, A.B.2
-
14
-
-
26444549375
-
Effective preprocessing in SAT through variable and clause elimination
-
Bacchus, F., & Walsh, T. (Eds.) Springer
-
Eén, N., & Biere, A. (2005). Effective preprocessing in SAT through variable and clause elimination. In Bacchus, F., & Walsh, T. (Eds.), SAT, Vol. 3569 of Lecture Notes in Computer Science, pp. 61-75. Springer.
-
(2005)
SAT, Vol. 3569 of Lecture Notes in Computer Science
, pp. 61-75
-
-
Eén, N.1
Biere, A.2
-
15
-
-
30344450270
-
An extensible SAT-solver
-
Giunchiglia, E., & Tacchella, A. (Eds.) Springer
-
Eén, N., & Sörensson, N. (2003). An extensible SAT-solver. In Giunchiglia, E., & Tacchella, A. (Eds.), SAT, Vol. 2919 of Lecture Notes in Computer Science, pp. 502-518. Springer.
-
(2003)
SAT, Vol. 2919 of Lecture Notes in Computer Science
, pp. 502-518
-
-
Eén, N.1
Sörensson, N.2
-
16
-
-
33749557305
-
Translating pseudo-boolean constraints into SAT
-
Eén, N., & Sörensson, N. (2006). Translating pseudo-Boolean constraints into SAT. JSAT, 2(1-4), 1-26.
-
(2006)
JSAT
, vol.2
, Issue.1-4
, pp. 1-26
-
-
Eén, N.1
Sörensson, N.2
-
17
-
-
85017361958
-
Symmetry breaking as a prelude to implied constraints: A constraint modeling pattern
-
171175 Press
-
Frisch, A. M., Jefferson, C., & Miguel, I. (2004). Symmetry breaking as a prelude to implied constraints: A constraint modeling pattern. In Proc. 16th Euro. Conf. on AI, 171175, pp. 171-175. Press.
-
(2004)
Proc. 16th Euro. Conf. on AI
, pp. 171-175
-
-
Frisch, A.M.1
Jefferson, C.2
Miguel, I.3
-
18
-
-
0030667755
-
Demonstration of a word design strategy for DNA computing on surfaces
-
Frutos, A. G., Liu, Q., Thiel, A. J., Sanner, A. M. W., Condon, A. E., Smith, L. M., & Corn, R. M. (1997). Demonstration of a word design strategy for DNA computing on surfaces. Journal of Nucleic Acids Research, 25(23), 4748-4757.
-
(1997)
Journal of Nucleic Acids Research
, vol.25
, Issue.23
, pp. 4748-4757
-
-
Frutos, A.G.1
Liu, Q.2
Thiel, A.J.3
Sanner, A.M.W.4
Condon, A.E.5
Smith, L.M.6
Corn, R.M.7
-
20
-
-
38149035262
-
The log-support encoding of CSP into SAT
-
Bessiere, C. (Ed.) Providence, RI, USA. Springer
-
Gavanelli, M. (2007). The log-support encoding of CSP into SAT. In Bessiere, C. (Ed.), CP, Vol. 4741 of LNCS, pp. 815-822, Providence, RI, USA. Springer.
-
(2007)
CP, Vol. 4741 of LNCS
, pp. 815-822
-
-
Gavanelli, M.1
-
21
-
-
10344232712
-
Toward leaner binary-clause reasoning in a satisfiability solver
-
Gelder, A. V. (2005). Toward leaner binary-clause reasoning in a satisfiability solver. Ann. Math. Artif. Intell., 43(1), 239-253.
-
(2005)
Ann. Math. Artif. Intell.
, vol.43
, Issue.1
, pp. 239-253
-
-
Gelder, A.V.1
-
22
-
-
84886023919
-
Minion: A fast scalable constraint solver
-
Brewka, G., Coradeschi, S., Perini, A., & Traverso, P. (Eds.) IOS Press
-
Gent, I. P., Jefferson, C., & Miguel, I. (2006). Minion: A fast scalable constraint solver. In Brewka, G., Coradeschi, S., Perini, A., & Traverso, P. (Eds.), ECAI, Vol. 141 of Frontiers in Artificial Intelligence and Applications, pp. 98-102. IOS Press.
-
(2006)
ECAI, Vol. 141 of Frontiers in Artificial Intelligence and Applications
, pp. 98-102
-
-
Gent, I.P.1
Jefferson, C.2
Miguel, I.3
-
24
-
-
84948994516
-
Heavy-tailed distributions in combinatorial search
-
Smolka, G. (Ed.) Springer
-
Gomes, C. P., Selman, B., & Crato, N. (1997). Heavy-tailed distributions in combinatorial search. In Smolka, G. (Ed.), CP, Vol. 1330 of LNCS, pp. 121-135. Springer.
-
(1997)
CP, Vol. 1330 of LNCS
, pp. 121-135
-
-
Gomes, C.P.1
Selman, B.2
Crato, N.3
-
25
-
-
79959465742
-
Efficient CNF simplification based on binary implication graphs
-
Sakallah, K. A., & Simon, L. (Eds.) Springer
-
Heule, M., Järvisalo, M., & Biere, A. (2011). Efficient CNF simplification based on binary implication graphs. In Sakallah, K. A., & Simon, L. (Eds.), SAT, Vol. 6695 of Lecture Notes in Computer Science, pp. 201-215. Springer.
-
(2011)
SAT, Vol. 6695 of Lecture Notes in Computer Science
, pp. 201-215
-
-
Heule, M.1
Järvisalo, M.2
Biere, A.3
-
27
-
-
84875489077
-
An effective SAT encoding for magic labeling
-
Faigle, U., Schrader, R., & Herrmann, D. (Eds.)
-
Jäger, G. (2010). An effective SAT encoding for magic labeling. In Faigle, U., Schrader, R., & Herrmann, D. (Eds.), CTW, pp. 97-100.
-
(2010)
CTW
, pp. 97-100
-
-
Jäger, G.1
-
28
-
-
0041513053
-
Equivalent literal propagation in the DLL procedure
-
Li, C. (2003). Equivalent literal propagation in the DLL procedure. Discrete Applied Mathematics, 130(2), 251-276.
-
(2003)
Discrete Applied Mathematics
, vol.130
, Issue.2
, pp. 251-276
-
-
Li, C.1
-
29
-
-
0035982713
-
Vertex-magic total labelings of graphs
-
MacDougall, J., Miller, M., Slamin, M., & Wallis, W. (2002). Vertex-magic total labelings of graphs. Utilitas Mathematica, 61, 3-21.
-
(2002)
Utilitas Mathematica
, vol.61
, pp. 3-21
-
-
MacDougall, J.1
Miller, M.2
Slamin, M.3
Wallis, W.4
-
30
-
-
52249113653
-
Evaluating ASP and commercial solvers on the CSPLib
-
Mancini, T., Micaletto, D., Patrizi, F., & Cadoli, M. (2008). Evaluating ASP and commercial solvers on the CSPLib. Constraints, 13(4), 407-436.
-
(2008)
Constraints
, vol.13
, Issue.4
, pp. 407-436
-
-
Mancini, T.1
Micaletto, D.2
Patrizi, F.3
Cadoli, M.4
-
31
-
-
84864183504
-
Coprocessor 2.0 - A flexible CNF simplifier - (tool presentation)
-
Cimatti, A., & Sebastiani, R. (Eds.) Springer
-
Manthey, N. (2012). Coprocessor 2.0 - a flexible CNF simplifier - (tool presentation). In Cimatti, A., & Sebastiani, R. (Eds.), SAT, Vol. 7317 of Lecture Notes in Computer Science, pp. 436-441. Springer.
-
(2012)
SAT, Vol. 7317 of Lecture Notes in Computer Science
, pp. 436-441
-
-
Manthey, N.1
-
32
-
-
84871973779
-
-
Metodi, A. (2012). BEE. http://amit.metodi.me/research/bee/.
-
(2012)
BEE
-
-
Metodi, A.1
-
33
-
-
84871956927
-
Compiling finite domain constraints to SAT with BEE
-
Metodi, A., & Codish, M. (2012). Compiling finite domain constraints to SAT with BEE. TPLP, 12(4-5), 465-483.
-
(2012)
TPLP
, vol.12
, Issue.4-5
, pp. 465-483
-
-
Metodi, A.1
Codish, M.2
-
34
-
-
80053014980
-
Boolean equi-propagation for optimized SAT encoding
-
Lee, J. H.-M. (Ed.) Springer
-
Metodi, A., Codish, M., Lagoon, V., & Stuckey, P. J. (2011). Boolean equi-propagation for optimized SAT encoding. In Lee, J. H.-M. (Ed.), CP, Vol. 6876 of LNCS, pp. 621-636. Springer.
-
(2011)
CP, Vol. 6876 of LNCS
, pp. 621-636
-
-
Metodi, A.1
Codish, M.2
Lagoon, V.3
Stuckey, P.J.4
-
35
-
-
38149141760
-
Minizinc: Towards a standard CP modeling language
-
Bessiere, C. (Ed.) Providence, RI, USA. Springer-Verlag
-
Nethercote, N., Stuckey, P. J., Becket, R., Brand, S., Duck, G. J., & Tack, G. (2007). Minizinc: Towards a standard CP modeling language. In Bessiere, C. (Ed.), CP2007, Vol. 4741 of Lecture Notes in Computer Science, pp. 529-543, Providence, RI, USA. Springer-Verlag.
-
(2007)
CP2007, Vol. 4741 of Lecture Notes in Computer Science
, pp. 529-543
-
-
Nethercote, N.1
Stuckey, P.J.2
Becket, R.3
Brand, S.4
Duck, G.J.5
Tack, G.6
-
37
-
-
84864217223
-
-
v2.5.1
-
Soos, M. (2010). CryptoMiniSAT, v2.5.1. http://www.msoos.org/ cryptominisat2.
-
(2010)
CryptoMiniSAT
-
-
Soos, M.1
-
38
-
-
62949181956
-
Compiling finite linear CSP into SAT
-
Tamura, N., Taga, A., Kitagawa, S., & Banbara, M. (2009). Compiling finite linear CSP into SAT. Constraints, 14(2), 254-272.
-
(2009)
Constraints
, vol.14
, Issue.2
, pp. 254-272
-
-
Tamura, N.1
Taga, A.2
Kitagawa, S.3
Banbara, M.4
-
39
-
-
0016495233
-
Efficiency of a good but not linear set union algorithm
-
Tarjan, R. (1975). Efficiency of a good but not linear set union algorithm. JACM, 22(2), 215-225.
-
(1975)
JACM
, vol.22
, Issue.2
, pp. 215-225
-
-
Tarjan, R.1
-
41
-
-
23744487218
-
The alldifferent constraint: A survey
-
van Hoeve, W. J. (2001). The alldifferent constraint: A survey. CoRR: http://arxiv.org/abs/cs.PL/0105015.
-
(2001)
CoRR
-
-
Van Hoeve, W.J.1
|