Sat4j
From MaRDI portal
Cited in
(only showing first 100 items - show all)- OptSAT
- Pueblo
- Open-WBO-Inc
- Saturn
- TAMPR
- Walksat
- maxSAT-based large neighborhood search for high school timetabling
- Solving MaxSAT with bit-vector optimization
- Siege
- QingTing1
- PBS
- SAT competition
- On tackling the limits of resolution in SAT solving
- Introducing Pareto minimal correction subsets
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- SATIRE
- OPBDP
- Modeling and solving staff scheduling with partial weighted maxSAT
- RPOLY
- Intra- and interdiagram consistency checking of behavioral multiview models
- A bounded model checker for three-valued abstractions of concurrent software systems
- Understanding cutting planes for QBFs
- An assumption-based approach for solving the minimal S5-satisfiability problem
- JaCoP
- MUltlog
- Chaff
- BPEL2PN
- NiVER
- Goanna
- CLIPS
- PicoSAT
- ToulBar2
- Scarab
- PrecoSAT
- Glucose
- Securing state reconstruction under sensor and actuator attacks: theory and design
- TreeTagger
- OPIUM
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- ESPRESSO
- PhyloWS
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- RunLim
- Runsolver
- Using the method of conditional expectations to supply an improved starting point for CCLS
- Lifted structural invariant analysis of Petri net product lines
- Soot
- OptiLog: a framework for SAT-based systems
- On dedicated CDCL strategies for PB solvers
- A model of random industrial SAT
- Motras
- A symbolic decision procedure for symbolic alternating finite automata
- ProbView
- vUML
- Jerusat
- A novel algorithm for Max Sat calling MOCE to order
- QMaxSAT
- MiniMaxSat
- MSUnCore
- VMC
- MIO Workbench
- MTSA
- Herbrand constructivization for automated intuitionistic theorem proving
- Open-WBO
- PackUp
- GlueMiniSat
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- XHSTT
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- Improved WPM encoding for coalition structure generation under MC-nets
- Iterative and core-guided maxsat solving: a survey and assessment
- Cutting to the chase.
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Modal transition system encoding of featured transition systems
- A taxonomy of exact methods for partial Max-SAT
- Abstract interpretation of microcontroller code: intervals meet congruences
- BAP
- CCASat
- ROSoClingo
- Abstract cores in implicit hitting set MaxSat solving
- On weakening strategies for PB solvers
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
- Constructing Markov Logic Networks from First-Order Default Rules
- LMHS
- Gen2sat
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- 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
- Model construction and priority synthesis for simple interaction systems
- SAT-based termination analysis using monotonicity constraints over the integers
- A New Look at BDDs for Pseudo-Boolean Constraints
- WPM2
- Open-WBO: a modular MaxSAT solver
This page was built for software: Sat4j
