Towards Robust CNF Encodings of Cardinality Constraints (Q3523075): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: João P. Marques-Silva / rank
Normal rank
 
Property / author
 
Property / author: João P. Marques-Silva / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BerkMin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Siege / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117182791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parallel complexity of discrete relaxation in constraint satisfaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time transformation of linear inequalities into conjunctive normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATO: An efficient propositional prover / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:51, 28 June 2024

scientific article
Language Label Description Also known as
English
Towards Robust CNF Encodings of Cardinality Constraints
scientific article

    Statements

    Towards Robust CNF Encodings of Cardinality Constraints (English)
    0 references
    0 references
    0 references
    2 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references