Siege

The following x86-linux executables are available for non-commercial use only. siege takes one or two arguments, (first) the filename of a DIMACS-format CNF, and optionally (second) a seed for the random number generator. For example, ”siege_v4 7pipe.cnf 666”. If a seed is not given, the system time is used. Certificates, etc., are appended to a file, ”siege.results”.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 37 articles )

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

1 2 next

  1. Liang, Jia Hui; Ganesh, Vijay; Poupart, Pascal; Czarnecki, Krzysztof: Learning rate based branching heuristic for SAT solvers (2016)
  2. Li, Pingke; Jin, Qingwei: On the resolution of bipolar max-min equations. (2016)
  3. Biere, Armin; Fröhlich, Andreas: Evaluating CDCL variable scoring schemes (2015)
  4. Achá, Roberto Asín; Nieuwenhuis, Robert: Curriculum-based course timetabling with SAT and MaxSAT (2014)
  5. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Conflict-driven answer set solving: from theory to practice (2012)
  6. Martins, Ruben; Manquinho, Vasco; Lynce, Inês: An overview of parallel SAT solving (2012)
  7. Rintanen, Jussi: Planning as satisfiability: heuristics (2012)
  8. Atserias, A.; Fichte, J. K.; Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution (2011)
  9. Gebser, Martin; Kaufmann, Benjamin; Kaminski, Roland; Ostrowski, Max; Schaub, Torsten; Schneider, Marius: Potassco: the Potsdam answer set solving collection (2011)
  10. Pipatsrisawat, Knot; Darwiche, Adnan: On the power of clause-learning SAT solvers as resolution engines (2011)
  11. Pipatsrisawat, Knot; Darwiche, Adnan: On modern clause-learning satisfiability solvers (2010) ioport
  12. Achterberg, Tobias: SCIP: solving constraint integer programs (2009)
  13. Atserias, Albert; Fichte, Johannes Klaus; Thurley, Marc: Clause-learning algorithms with many restarts and bounded-width resolution (2009)
  14. Chu, Geoffrey; Harwood, Aaron; Stuckey, Peter J.: Cache conscious data structures for Boolean satisfiability solvers (2009)
  15. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Solution enumeration for projected Boolean search problems (2009)
  16. Mu, Kedian; Liu, Weiru; Jin, Zhi; Lu, Ruqian; Yue, Anbu; Bell, David: Handling inconsistency in distributed software requirements specifications based on prioritized merging (2009)
  17. Wang, Yiqiao; Mcilraith, Sheila A.; Yu, Yijun; Mylopoulos, John: Monitoring and diagnosing software requirements (2009) ioport
  18. Pipatsrisawat, Knot; Palyan, Akop; Chavira, Mark; Choi, Arthur; Darwiche, Adnan: Solving weighted Max-SAT problems in a reduced search space: a performance analysis (2008)
  19. van der Krogt, Roman: Modification strategies for SAT-based plan adaptation (2008)
  20. de Moura, Leonardo; Dutertre, Bruno; Shankar, Natarajan: A tutorial on satisfiability modulo theories (2007)

1 2 next