Sat4j
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Cutting to the chase. Solving linear integer arithmetic
- Algorithms for Weighted Boolean Optimization
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Riss
- OptSAT
- Pueblo
- Saturn
- TAMPR
- QingTing1
- Siege
- Walksat
- PBS
- SAT competition
- SATIRE
- OPBDP
- RPOLY
- JaCoP
- MUltlog
- Chaff
- BPEL2PN
- CLIPS
- Goanna
- NiVER
- PicoSAT
- Scarab
- ToulBar2
- Glucose
- PrecoSAT
- OPIUM
- ESPRESSO
- PhyloWS
- TreeTagger
- RunLim
- Runsolver
- Motras
- Jerusat
- ProbView
- Soot
- QMaxSAT
- MiniMaxSat
- MSUnCore
- MIO Workbench
- vUML
- GlueMiniSat
- Open-WBO
- PackUp
- VMC
- XHSTT
- BAP
- CCASat
- ROSoClingo
- Gen2sat
- LMHS
- WPM2
- MaxHS
- CodeHint
- Denali
- halp
- JSketch
- CNFgen
- PARSEWeb
- MaxPre
- XSnippet
- PIPE2
- APT
- vZ
- KEMS
- lp2normal
- Tuffy
- SCCWalk
- AO4BPEL
- maxino
- Slakje
- WPDS++
- WhaleProver
- RockIt
- Pint
- tiny_sha3
- CCLS
- CCEHC
- SATLike
- RC2
- Mjollnir
- fmp
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Iterative and core-guided maxsat solving: a survey and assessment
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Component-based synthesis for complex APIs
- Open-WBO: a modular MaxSAT solver
- Algorithms for the workflow satisfiability problem engineered for counting constraints
- New local search methods for partial MaxSAT
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- MTSA
- Minimally unsatisfiable Boolean circuits
- Herbrand constructivization for automated intuitionistic theorem proving
- Cutting to the chase.
- Lifted structural invariant analysis of Petri net product lines
- Improved WPM encoding for coalition structure generation under MC-nets
This page was built for software: Sat4j
