SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5584 LNCS, Issue , 2009, Pages 167-180

Cardinality networks and their applications

(4) Asín, Roberto a Nieuwenhuis, Robert a Oliveras, Albert a Rodríguez Carbonell, Enric a

a UNIVERSITAT POLITÈCNICA DE CATALUNYA (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARC CONSISTENCY; AUXILIARY VARIABLES; CARDINALITIES; CARDINALITY CONSTRAINTS; ENCODINGS; REAL-WORLD; RECURSIVE DEFINITIONS; SINGLE VARIABLE; SORTING NETWORK; UNIT PROPAGATION;

RECURSIVE FUNCTIONS;

ENCODING (SYMBOLS);

EID: 70350638581 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-642-02777-2_18 Document Type: Conference Paper

Times cited : (68)

References (8)

1
- 85154002090
- Sorting Networks and their Applications
- Batcher, K.E.: Sorting Networks and their Applications. In: AFIPS Spring Joint Computing Conference, pp. 307-314 (1968)
- (1968) AFIPS Spring Joint Computing Conference , pp. 307-314
- Batcher, K.E.¹

2
- 33646203802
- Bailleux, O., Boufkhad, Y.: Effcient CNF encoding of Boolean Cardinality Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, 2833, pp. 108-122. Springer, Heidelberg (2003)
- Bailleux, O., Boufkhad, Y.: Effcient CNF encoding of Boolean Cardinality Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108-122. Springer, Heidelberg (2003)

3
- 84919401135
- A Machine Program for Theorem-Proving. Communications of the ACM
- Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Communications of the ACM, CACM 5(7), 394-397 (1962)
- (1962) CACM , vol.5 , Issue.7 , pp. 394-397
- Davis, M.¹ Logemann, G.² Loveland, D.³

4
- 84881072062
- A Computing Procedure for Quantification Theory
- Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM, JACM 7(3), 201-215 (1960)
- (1960) Journal of the ACM, JACM , vol.7 , Issue.3 , pp. 201-215
- Davis, M.¹ Putnam, H.²

5
- 33749557305
- Translating Pseudo-Boolean Constraints into SAT
- Eeń, N., Sörensson, N.: Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 1-26 (2006)
- (2006) Journal on Satisfiability, Boolean Modeling and Computation , vol.2 , pp. 1-26
- Eeń, N.¹ Sörensson, N.²

6
- 49749083804
- Algorithms for Maximum Satisfiability usint Unsatisfiable Cores. In: DATE
- Los Alamitos
- Marques-Silva, J., Planes, J.: Algorithms for Maximum Satisfiability usint Unsatisfiable Cores. In: DATE 2008, pp. 408-413. IEEE Computer Society Press, Los Alamitos (2008)
- (2008) 408-413. IEEE Computer Society Press , pp. 2008
- Marques-Silva, J.¹ Planes, J.²

7
- 33646181818
- Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005, 3709, pp. 827-831. Springer, Heidelberg (2005)
- Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005, vol. 3709, pp. 827-831. Springer, Heidelberg (2005)

8
- 38149062117
- Marques-Silva, J.P., Lynce, I.: Towards robust CNF encodings of cardinality constraints. In: Bessiére, C. (ed.) CP 2007. LNCS, 4741, pp. 483-497. Springer, Heidelberg (2007)
- Marques-Silva, J.P., Lynce, I.: Towards robust CNF encodings of cardinality constraints. In: Bessiére, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 483-497. Springer, Heidelberg (2007)

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