swMATH7283MaRDI QIDQ19328FDOQ19328
Author name not available (Why is that?)
Official website: http://sat4j.org/
Cited In (only showing first 100 items - show all)
- 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
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- COBA 2.0: A Consistency-Based Belief Change System
- Abstract interpretation of microcontroller code: intervals meet congruences
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- A taxonomy of exact methods for partial Max-SAT
- Decision-making coordination and efficient reasoning techniques for feature-based configuration
- Exploiting the power of MIP solvers in MAXSAT
- Abstract cores in implicit hitting set MaxSat solving
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- 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
- \(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
- Intra- and interdiagram consistency checking of behavioral multiview models
- A symbolic decision procedure for symbolic alternating finite automata
- On weakening strategies for PB solvers
- Focused most probable world computations in probabilistic logic programs
- SAT solving for termination proofs with recursive path orders and dependency pairs
- A novel algorithm for Max Sat calling MOCE to order
- Solving MaxSAT with bit-vector optimization
- Proving termination of programs automatically with AProVE
- A New Look at BDDs for Pseudo-Boolean Constraints
- A bounded model checker for three-valued abstractions of concurrent software systems
- Understanding cutting planes for QBFs
- dot
- Improved WPM encoding for coalition structure generation under MC-nets
- 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
- SAT and hybrid models of the car sequencing problem
- 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
- Introducing Pareto minimal correction subsets
- On tackling the limits of resolution in SAT solving
- Transfer function synthesis without quantifier elimination
- WPM3
- On improving MUS extraction algorithms
- Open-WBO-Inc
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- The configurable SAT solver challenge (CSSC)
- Automatic abstraction for intervals using Boolean formulae
- maxSAT-based large neighborhood search for high school timetabling
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- Modal transition system encoding of featured transition systems
- 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
- QMaxSATpb
- Parameterized complexity of the workflow satisfiability problem
- SAT-based termination analysis using monotonicity constraints over the integers
- pystablemotifs
- Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
- Equality saturation: a new approach to optimization
- How to apply SAT-solving for the equivalence test of monotone normal forms
- Title not available (Why is that?)
- Advanced Boolean techniques. Selected papers from the 13th international workshop on Boolean problems, Bremen, Germany, September 19--21, 2018
- Model construction and priority synthesis for simple interaction systems
- Graph colouring is hard for algorithms based on Hilbert's Nullstellensatz and Gröbner bases
- Constructing Markov Logic Networks from First-Order Default Rules
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Optimizing phylogenetic supertrees using answer set programming
- MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Proving Termination with (Boolean) Satisfaction
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Transfer function synthesis without quantifier elimination
- Herbrand constructivization for automated intuitionistic theorem proving
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Minimally unsatisfiable Boolean circuits
- Riss
- Algorithms for the workflow satisfiability problem engineered for counting constraints
- New local search methods for partial MaxSAT
- OptSAT
- Pueblo
- QingTing1
- Siege
- PBS
- SAT competition
- SATIRE
- OPBDP
- RPOLY
- JaCoP
- MUltlog
- Chaff
- BPEL2PN
- CLIPS
- Goanna
- NiVER
- PicoSAT
This page was built for software: Sat4j
