Sat4j

swMATH7283MaRDI QIDQ19328FDOQ19328

Author name not available (Why is that?)

Cited In (86)

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

This page was built for software: Sat4j