Sat4j

swMATH7283MaRDI QIDQ19328

No author found.

Related Items (86)

Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way ⋮ Quantified maximum satisfiability ⋮ MaxSAT by improved instance-specific algorithm configuration ⋮ Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ A symbolic decision procedure for symbolic alternating finite automata ⋮ Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints ⋮ A novel algorithm for Max Sat calling MOCE to order ⋮ Algorithms for the workflow satisfiability problem engineered for counting constraints ⋮ New local search methods for partial MaxSAT ⋮ maxSAT-based large neighborhood search for high school timetabling ⋮ Open-WBO: A Modular MaxSAT Solver, ⋮ Proving Termination of Programs Automatically with AProVE ⋮ SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ Solving MaxSAT with bit-vector optimization ⋮ Exploiting the Power of mip Solvers in maxsat ⋮ Abstract cores in implicit hitting set MaxSat solving ⋮ On weakening strategies for PB solvers ⋮ Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem ⋮ Herbrand constructivization for automated intuitionistic theorem proving ⋮ On tackling the limits of resolution in SAT solving ⋮ Introducing Pareto minimal correction subsets ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Optimizing phylogenetic supertrees using answer set programming ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Modal transition system encoding of featured transition systems ⋮ Coalition structure generation: a survey ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Component-based synthesis for complex APIs ⋮ COBA 2.0: A Consistency-Based Belief Change System ⋮ Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability ⋮ Abstract interpretation of microcontroller code: intervals meet congruences ⋮ Focused most probable world computations in probabilistic logic programs ⋮ Unnamed Item ⋮ MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks* ⋮ SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata ⋮ Modeling and solving staff scheduling with partial weighted maxSAT ⋮ An overview of parallel SAT solving ⋮ Reformulation based MaxSat robustness ⋮ Monitoring and recovery for web service applications ⋮ Equality Saturation: A New Approach to Optimization ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms ⋮ Minimally Unsatisfiable Boolean Circuits ⋮ On Improving MUS Extraction Algorithms ⋮ The configurable SAT solver challenge (CSSC) ⋮ CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability ⋮ Securing state reconstruction under sensor and actuator attacks: theory and design ⋮ Intra- and interdiagram consistency checking of behavioral multiview models ⋮ Learning discrete decomposable graphical models via constraint optimization ⋮ Model Construction and Priority Synthesis for Simple Interaction Systems ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ SAT and Hybrid Models of the Car Sequencing Problem ⋮ Decision-making coordination and efficient reasoning techniques for feature-based configuration ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ Automatic Abstraction for Intervals Using Boolean Formulae ⋮ Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation ⋮ A bounded model checker for three-valued abstractions of concurrent software systems ⋮ Understanding cutting planes for QBFs ⋮ Parameterized Complexity of the Workflow Satisfiability Problem ⋮ Cutting to the Chase Solving Linear Integer Arithmetic ⋮ Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games ⋮ An assumption-based approach for solving the minimal S5-satisfiability problem ⋮ Transfer Function Synthesis without Quantifier Elimination ⋮ Transfer Function Synthesis without Quantifier Elimination ⋮ Unnamed Item ⋮ Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi ⋮ SAT-based termination analysis using monotonicity constraints over the integers ⋮ Advanced Boolean Techniques ⋮ Solving (Weighted) Partial MaxSAT through Satisfiability Testing ⋮ Algorithms for Weighted Boolean Optimization ⋮ Constructing Markov Logic Networks from First-Order Default Rules ⋮ Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search ⋮ Improved WPM encoding for coalition structure generation under MC-nets ⋮ Proving Termination with (Boolean) Satisfaction ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS ⋮ Lifted structural invariant analysis of Petri net product lines ⋮ Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT ⋮ Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ A New Look at BDDs for Pseudo-Boolean Constraints ⋮ Cutting to the chase. ⋮ OptiLog: a framework for SAT-based systems ⋮ On dedicated CDCL strategies for PB solvers ⋮ A model of random industrial SAT

This page was built for software: Sat4j