Cardinality Networks and Their Applications

DOI10.1007/978-3-642-02777-2_18MaRDI QIDQ3637166zbMATH OpenOpenAlexFDO

Authors Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell

Publication date 7 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02777-2_18

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Cardinality networks: a theoretical and empirical study
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Encoding cardinality constraints using multiway merge selection networks
• A parametric approach for smaller and better encodings of cardinality constraints
• Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency

Cites work

• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Efficient CNF encoding of Boolean cardinality constraints
• Towards Robust CNF Encodings of Cardinality Constraints
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

Cited in

(23)

• Learning Optimal Decision Sets and Lists with SAT
• Cardinality networks: a theoretical and empirical study
• Resizing cardinality constraints for MaxSAT
• Cardinality of upper average and its application to network optimization
• Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
• Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
• Modeling and solving staff scheduling with partial weighted maxSAT
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Normalizing cardinality rules using merging and sorting constructions
• meSAT: multiple encodings of CSP to SAT
• Detecting cardinality constraints in CNF
• A Boolean satisfiability approach to the resource-constrained project scheduling problem
• A parametric approach for smaller and better encodings of cardinality constraints
• Faster merging networks with a small constant period
• Efficient CNF encoding of Boolean cardinality constraints
• Encoding cardinality constraints using multiway merge selection networks
• Efficient SAT-based encodings of conditional cardinality constraints
• Curriculum-based course timetabling with SAT and MaxSAT
• Sorting networks: to the end and back again
• \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
• Towards Robust CNF Encodings of Cardinality Constraints
• Perfect hashing and CNF encodings of cardinality constraints
• Pairwise cardinality networks

This page was built for publication: Cardinality Networks and Their Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637166)