scientific article; zbMATH DE number 5139161
From MaRDI portal
Publication:3429154
Recommendations
- scientific article; zbMATH DE number 5139168
- 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
- Transforming Boolean equalities into constraints
Cited in
(94)- Minimal sets on propositional formulae. Problems and reductions
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
- Conflict-driven answer set solving: from theory to practice
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Encoding cardinality constraints using multiway merge selection networks
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- OptiLog: a framework for SAT-based systems
- On preprocessing for weighted MaxSAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Propagation via lazy clause generation
- Computing AES related-key differential characteristics with constraint programming
- A multiparametric view on answer set programming
- On the hardness of solving edge matching puzzles as SAT or CSP problems
- Iterative and core-guided maxsat solving: a survey and assessment
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- A logical approach to efficient Max-SAT solving
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Formal methods for reasoning and uncertainty reduction in evidential grid maps
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- A 0-1 integer linear programming approach to schedule outages of nuclear power plants
- Complete Boolean satisfiability solving algorithms based on local search
- Search techniques for SAT-based Boolean optimization
- Delegatable functional signatures
- Mitigating multi-target attacks in hash-based signatures
- Writing declarative specifications for clauses
- DRAT proofs for XOR reasoning
- An experiment with satisfiability modulo SAT
- Applying visible strong equivalence in answer-set program transformations
- Improving the normalization of weight rules in answer set programs
- Optimal base encodings for pseudo-Boolean constraints
- BDDs for pseudo-Boolean constraints -- revisited
- Propositional SAT solving
- The automatic detection of token structures and invariants using SAT checking
- Decomposing SAT Instances with Pseudo Backbones
- Quantitative logic reasoning
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Towards Robust CNF Encodings of Cardinality Constraints
- Cardinality Networks and Their Applications
- New Encodings of Pseudo-Boolean Constraints into CNF
- Algorithms for Weighted Boolean Optimization
- Boolean lexicographic optimization: algorithms \& applications
- Shared aggregate sets in answer set programming
- Reasoning with uncertain and inconsistent OWL ontologies
- Reformulation based MaxSat robustness
- Boosting Answer Set Optimization with Weighted Comparator Networks
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Hard satisfiable 3-SAT instances via autocorrelation
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- Mining top-\(k\) motifs with a SAT-based framework
- MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
- Resizing cardinality constraints for MaxSAT
- scientific article; zbMATH DE number 7300350 (Why is no real title available?)
- scientific article; zbMATH DE number 7300363 (Why is no real title available?)
- Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
- Technology for translating combinatorial problems into Boolean equations
- Merging variables: one technique of search in pseudo-Boolean optimization
- Rewriting optimization statements in answer-set programs
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Cardinality networks: a theoretical and empirical study
- Haplotype inference with pseudo-Boolean optimization
- The weighted grammar constraint
- Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics
- Theory and Applications of Satisfiability Testing
- Boolean satisfiability with transitivity constraints
- Solving satisfiability problems with preferences
- Interactive portfolio selection involving multicriteria sorting models
- Generalized Alignment-Based Trace Clustering of Process Behavior
- Computer-aided constructions of commafree codes
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Certified Core-Guided MaxSAT Solving
- Clausal proofs for pseudo-Boolean reasoning
- Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem
- Maximum satisfiability formulations for nonlinear integer programming
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- Revisiting pseudo-Boolean encodings from an integer perspective
- Improving local search algorithm for pseudo Boolean optimization
- Enumeration and construction of row-column designs
- Decision levels are stable: towards better SAT heuristics
- Declarative approaches to outcome determination in judgment aggregation
- Certified MaxSAT preprocessing
- Does subset sum admit short proofs?
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- KBO orientability
- Non existence of some mixed Moore graphs of diameter 2 using SAT
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
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 Q3429154)
