Sat4j

The Sat4j library, release 2.2 system description Sat4j is a java library for solving boolean satisfaction and optimization problems. It can solve SAT, MAXSAT, Pseudo-Boolean, Minimally Unsatisfiable Subset (MUS) problems. Being in Java, the promise is not to be the fastest one to solve those problems (a SAT solver in Java is about 3.25 times slower than its counterpart in C++), but to be full featured, robust, user friendly, and to follow Java design guidelines and code conventions (checked using static analysis of the source code). The library is designed for flexibility, by using heavily the decorator and strategy design patterns. Furthermore, Sat4j is open source, under the dual business friendly Eclipse Public License and academic friendly GNU LGPL license.


References in zbMATH (referenced in 33 articles )

Showing results 1 to 20 of 33.
Sorted by year (citations)

1 2 next

  1. Ansótegui, Carlos; Gabàs, Joel; Malitsky, Yuri; Sellmann, Meinolf: MaxSAT by improved instance-specific algorithm configuration (2016)
  2. Cohen, D.; Crampton, J.; Gagarin, A.; Gutin, G.; Jones, M.: Algorithms for the workflow satisfiability problem engineered for counting constraints (2016)
  3. Ignatiev, Alexey; Janota, Mikoláš; Marques-Silva, Joao: Quantified maximum satisfiability (2016)
  4. Zohar, Yoni; Zamansky, Anna: Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi (2016)
  5. Karapetyan, Daniel; Gagarin, Andrei; Gutin, Gregory: Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints (2015)
  6. Rahwan, Talal; Michalak, Tomasz P.; Wooldridge, Michael; Jennings, Nicholas R.: Coalition structure generation: a survey (2015)
  7. Artigues, Christian; Hebrard, Emmanuel; Mayer-Eichberger, Valentin; Siala, Mohamed; Walsh, Toby: SAT and hybrid models of the car sequencing problem (2014)
  8. Martins, Ruben; Manquinho, Vasco; Lynce, In^es: Open-WBO: a modular MaxSAT solver (2014)
  9. Soh, Takehide; Le Berre, Daniel; Roussel, Stéphanie; Banbara, Mutsunori; Tamura, Naoyuki: Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem (2014)
  10. Xie, Dingbao; Bu, Lei; Zhao, Jianhua; Li, Xuandong: SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (2014)
  11. Bofill, Miquel; Busquets, Dídac; Muñoz, Víctor; Villaret, Mateu: Reformulation based MaxSat robustness (2013)
  12. Brauer, Jörg; King, Andy; Kowalewski, Stefan: Abstract interpretation of microcontroller code: intervals meet congruences (2013)
  13. Davies, Jessica; Bacchus, Fahiem: Exploiting the power of MIP solvers in maxsat (2013)
  14. Jovanović, Dejan; De Moura, Leonardo: Cutting to the chase. (2013)
  15. Menai, Mohamed El Bachir; Al-Yahya, Tasniem Nasser: A taxonomy of exact methods for partial Max-SAT (2013)
  16. Morgado, Antonio; Heras, Federico; Liffiton, Mark; Planes, Jordi; Marques-Silva, Joao: Iterative and core-guided maxsat solving: a survey and assessment (2013)
  17. Simmonds, Jocelyn; Ben-David, Shoham; Chechik, Marsha: Monitoring and recovery for web service applications (2013)
  18. Soh, Takehide; Tamura, Naoyuki; Banbara, Mutsunori: Scarab: a rapid prototyping tool for SAT-based constraint programming systems (2013)
  19. Abío, Ignasi; Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric; Mayer-Eichberger, Valentin: A new look at BDDs for pseudo-Boolean constraints (2012)
  20. Brauer, Jörg; King, Andy: Transfer function synthesis without quantifier elimination (2012)

1 2 next