scientific article
From MaRDI portal
Publication:3429154
zbMath1116.68083MaRDI QIDQ3429154
Publication date: 30 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An experiment with satisfiability modulo SAT, Applying Visible Strong Equivalence in Answer-Set Program Transformations, Lower and Upper Bounds for Random Mimimum Satisfiability Problem, PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF, Propositional SAT Solving, KBO orientability, A logical approach to efficient Max-SAT solving, SAT solving for termination proofs with recursive path orders and dependency pairs, Shared aggregate sets in answer set programming, Improving the Normalization of Weight Rules in Answer Set Programs, Formal methods for reasoning and uncertainty reduction in evidential grid maps, Solving satisfiability problems with preferences, 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, Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms, Interactive portfolio selection involving multicriteria sorting models, Non existence of some mixed Moore graphs of diameter 2 using SAT, 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, Boolean lexicographic optimization: algorithms \& applications, A Boolean satisfiability approach to the resource-constrained project scheduling problem, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, A 0-1 integer linear programming approach to schedule outages of nuclear power plants, Complete Boolean satisfiability solving algorithms based on local search, Towards Robust CNF Encodings of Cardinality Constraints, Rewriting optimization statements in answer-set programs, MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*, Resizing cardinality constraints for MaxSAT, Reformulation based MaxSat robustness, Optimal Base Encodings for Pseudo-Boolean Constraints, On preprocessing for weighted MaxSAT, The Automatic Detection of Token Structures and Invariants Using SAT Checking, Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques, Quantitative Logic Reasoning, BDDs for Pseudo-Boolean Constraints – Revisited, Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions, Mining top-\(k\) motifs with a SAT-based framework, Reasoning with Uncertain and Inconsistent OWL Ontologies, Exploiting subproblem optimization in SAT-based maxsat algorithms, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Conflict-driven answer set solving: from theory to practice, Cardinality networks: a theoretical and empirical study, An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Haplotype inference with pseudo-Boolean optimization, The weighted grammar constraint, \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT, Encoding cardinality constraints using multiway merge selection networks, Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics, Propagation via lazy clause generation, Delegatable Functional Signatures, Mitigating Multi-target Attacks in Hash-Based Signatures, Computing AES related-key differential characteristics with constraint programming, Boosting Answer Set Optimization with Weighted Comparator Networks, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP, Cardinality Networks and Their Applications, New Encodings of Pseudo-Boolean Constraints into CNF, Algorithms for Weighted Boolean Optimization, SAT encodings for pseudo-Boolean constraints together with at-most-one constraints, A multiparametric view on answer set programming, Writing Declarative Specifications for Clauses, DRAT Proofs for XOR Reasoning, Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search, Unnamed Item, Unnamed Item, Unnamed Item, Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models, Unnamed Item, On the hardness of solving edge matching puzzles as SAT or CSP problems, On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving, Hard satisfiable 3-SAT instances via autocorrelation, Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT, Iterative and core-guided maxsat solving: a survey and assessment, OptiLog: a framework for SAT-based systems
Uses Software
