Cardinality Networks and Their Applications

DOI10.1007/978-3-642-02777-2_18zbMath1247.68244OpenAlexW1900929702MaRDI QIDQ3637166

Roberto Asín, Albert Oliveras, Robert Nieuwenhuis, 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)

Related Items (8)

Faster merging networks with a small constant period ⋮ Sorting networks: to the end and back again ⋮ A Boolean satisfiability approach to the resource-constrained project scheduling problem ⋮ Curriculum-based course timetabling with SAT and MaxSAT ⋮ Modeling and solving staff scheduling with partial weighted maxSAT ⋮ Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models ⋮ meSAT: multiple encodings of CSP to SAT ⋮ Learning Optimal Decision Sets and Lists with SAT

Cites Work

• Unnamed Item
• Towards Robust CNF Encodings of Cardinality Constraints
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Principles and Practice of Constraint Programming – CP 2003

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