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 87 articles )

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

1 2 3 4 5 next

  1. Barak-Pelleg, D.; Berend, D.; Saunders, J. C.: A model of random industrial SAT (2022)
  2. Ansótegui, Carlos; Ojeda, Jesús; Pacheco, Antonio; Pon, Josep; Salvia, Josep M.; Torres, Eduard: OptiLog: a framework for SAT-based systems (2021)
  3. Berend, Daniel; Golan, Shahar; Twitto, Yochai: A novel algorithm for Max Sat calling MOCE to order (2021)
  4. Devriendt, Jo; Gleixner, Ambros; Nordström, Jakob: Learn to relax: integrating (0-1) integer linear programming with pseudo-Boolean conflict-driven search (2021)
  5. Le Berre, Daniel; Wallon, Romain: On dedicated CDCL strategies for PB solvers (2021)
  6. Zavatteri, Matteo; Combi, Carlo; Rizzi, Romeo; Viganò, Luca: Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way (2021)
  7. Berg, Jeremias; Bacchus, Fahiem; Poole, Alex: Abstract cores in implicit hitting set MaxSat solving (2020)
  8. Cai, Shaowei; Lei, Zhendong: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (2020)
  9. Chen, Qian Matteo; Finzi, Alberto; Mancini, Toni; Melatti, Igor; Tronci, Enrico: MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks (2020)
  10. De Wulf, Wolf; Bogaerts, Bart: \textsclp2pb: translating answer set programs into pseudo-Boolean theories (2020)
  11. Drechsler, Rolf (ed.); Soeken, Mathias (ed.): Advanced Boolean techniques. Selected papers from the 13th international workshop on Boolean problems, Bremen, Germany, September 19--21, 2018 (2020)
  12. Le Berre, Daniel; Marquis, Pierre; Wallon, Romain: On weakening strategies for PB solvers (2020)
  13. Nadel, Alexander: Polarity and variable selection heuristics for SAT-based anytime MaxSAT (2020)
  14. Rocha, Thiago Alves; Martins, Ana Teresa; Ferreira, Francicleber Martins: Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (2020)
  15. Showkatbakhsh, Mehrdad; Shoukry, Yasser; Diggavi, Suhas N.; Tabuada, Paulo: Securing state reconstruction under sensor and actuator attacks: theory and design (2020)
  16. Demirović, Emir; Musliu, Nysret; Winter, Felix: Modeling and solving staff scheduling with partial weighted maxSAT (2019)
  17. Ebner, Gabriel: Herbrand constructivization for automated intuitionistic theorem proving (2019)
  18. Joshi, Saurabh; Kumar, Prateek; Rao, Sukrut; Martins, Ruben: \textsfOpen-WBO-Inc: approximation strategies for incomplete weighted MaxSAT (2019)
  19. Liao, Xiaojuan; Koshimura, Miyuki; Nomoto, Kazuki; Ueda, Suguru; Sakurai, Yuko; Yokoo, Makoto: Improved WPM encoding for coalition structure generation under MC-nets (2019)
  20. Varshosaz, Mahsa; Luthmann, Lars; Mohr, Paul; Lochau, Malte; Mousavi, Mohammad Reza: Modal transition system encoding of featured transition systems (2019)

1 2 3 4 5 next