Cardinality networks: a theoretical and empirical study (Q538318): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study / 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: New Encodings of Pseudo-Boolean Constraints into CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / 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: Towards Robust CNF Encodings of Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / 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: A linear-time transformation of linear inequalities into conjunctive normal form / rank
 
Normal rank

Revision as of 01:55, 4 July 2024

scientific article
Language Label Description Also known as
English
Cardinality networks: a theoretical and empirical study
scientific article

    Statements

    Identifiers