scientific article; zbMATH DE number 5139168
From MaRDI portal
Publication:3429162
zbMATH Open1116.68078MaRDI QIDQ3429162FDOQ3429162
Authors: Olivier Bailleux, Yacine Boufkhad, Olivier Roussel 
Publication date: 30 March 2007
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 5139161
- scientific article; zbMATH DE number 1670770
- Boolean satisfiability with transitivity constraints
- SAT encodings of pseudo-Boolean constraints with at-most-one relations
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- Bridging constraint satisfaction and Boolean satisfiability
- New Encodings of Pseudo-Boolean Constraints into CNF
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
Cited In (26)
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- Boolean satisfiability with transitivity constraints
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Optimal base encodings for pseudo-Boolean constraints
- Boolean lexicographic optimization: algorithms \& applications
- Constrained pseudo-propositional logic
- Improving the normalization of weight rules in answer set programs
- Simplifying pseudo-Boolean constraints in residual number systems
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Title not available (Why is that?)
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Decomposing SAT Instances with Pseudo Backbones
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- A New Look at BDDs for Pseudo-Boolean Constraints
- BDDs for pseudo-Boolean constraints -- revisited
- Towards Robust CNF Encodings of Cardinality Constraints
- Title not available (Why is that?)
- New Encodings of Pseudo-Boolean Constraints into CNF
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- GAC Via Unit Propagation
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- Encoding cardinality constraints using multiway merge selection networks
- Algorithms for Weighted Boolean Optimization
- Cardinality networks: a theoretical and empirical study
- Clausal proofs for pseudo-Boolean reasoning
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429162)
