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