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
- Transfer function synthesis without quantifier elimination
- Herbrand constructivization for automated intuitionistic theorem proving
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- 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
- pystablemotifs
- 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
- Parameterized complexity of the workflow satisfiability problem
- Decision-making coordination and efficient reasoning techniques for feature-based configuration
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Abstract cores in implicit hitting set MaxSat solving
- Boolean lexicographic optimization: algorithms \& applications
- Exploiting the power of MIP solvers in MAXSAT
- 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
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- SAT-based termination analysis using monotonicity constraints over the integers
- 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
- Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
- Minimally unsatisfiable Boolean circuits
- 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
- 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
- A New Look at BDDs for Pseudo-Boolean Constraints
- WPM2
- MaxHS
- CodeHint
- Denali
- halp
- JSketch
- CNFgen
- PARSEWeb
- MaxPre
- XSnippet
- PIPE2
- APT
- vZ
- KEMS
This page was built for software: Sat4j
