sat4j.org

msoos.org

CryptoMiniSat 2 FAQ | Wonderings of a SAT geek

https://www.msoos.org/cryptominisat2-faq

Wonderings of a SAT geek. A blog about SAT solving and cryptography. This is just a short list of things that is often asked about CryptoMiniSat2. I strongly suggest that you also read my other. Is CryptoMiniSat2 just MiniSat with some hacks? No MiniSat’s “core” version from which CryptoMiniSat has been developed contained 1’500 lines of code. CryptoMiniSat contains 13’000 lines of code. Is CryptoMiniSat2 only good to solve cryptographic instances? Is CryptoMiniSat2 open source? Lists all new ideas used&...

bach.istc.kobe-u.ac.jp

SugarTracer

http://bach.istc.kobe-u.ac.jp/sugar/sugartracer

Web Browser GUI with Graphical Visualization. How to trace your CSP. This document describes the usage of SugarTracer. Program which can trace SAT solver's process working for a CNF file generated by Sugar. A SAT-based CSP solver). It shows trace information after decoding. Therefore, you can see the information at CSP level. Example of Tracing Open-Shop Scheduling instance gp03-01. Version 1.0.1, released 2012-12-02 Sun. The following files are also included. Class files of Sat4j. 1,863,453 bytes).

bach.istc.kobe-u.ac.jp

PBSugar: A SAT-based Pseudo-Boolean Solver

http://bach.istc.kobe-u.ac.jp/pbsugar

PBSugar: A SAT-based Pseudo-Boolean Solver. PBSugar is a SAT-based Pseudo-Boolean (PB for short) solver. Given PB instance is encoded to a SAT instance, and solved by a SAT solver. Currently, PBSugar can solve problems of the DEC-SMALLINT-LIN (decision problems, small integers, linear constraints) category. Comparing PBSugar with Sat4j, clasp, bsolo, wbo, and MiniSat. Release of version 1.1.1. Version 1.1.1, released 2013-02-14 Thu. Version 1.0.3, released 2013-01-29 Tue. Java version 1.6 or higher.

jfpc2010.greyc.fr

JFPC 2010

http://jfpc2010.greyc.fr/programme.html

Sixièmes Journées Francophones de Programmation par Contraintes (JFPC 2010). Il n'y aura pas de sessions parallèle, d'où la densité des journées. Les posters seront affichés à l'endroit où auront lieu les pauses. 8 h 15 - 9 h : accueil. 9 h - 10 h : Exposé invité. Modérateur Yves Deville. Improving Constraint Modelling Using Visualization. 10 h - 10 h 30 : pause. 10 h 30 - 12 h 10 : session SAT. Modérateur Chumin Li. Belaïd Benhamou, Tarek NABHANI and Richard Ostrowski. 12 h 10 - 14 h : repas. 16 h 10 - ...

satlive.org

Solvers

http://www.satlive.org/solvers

Keep up to date with research on the satisfiability problem. That page is far from being complete. Do not hesitate to drop me an email or make a pull request to include your favorite solver here. Here is a list of solvers available from the SAT community for research purposes. Those solvers are expected to run out-of-the-box on recent computers. Stochastic Local Search solvers. FPGA based sat solvers. Quantified Boolean Formulas solvers. From Artois University, France.

en.wikipedia.org

Boolean satisfiability problem - Wikipedia, the free encyclopedia

https://en.wikipedia.org/wiki/Boolean_satisfiability_problem

From Wikipedia, the free encyclopedia. 3SAT" redirects here. For the Central European television network, see 3sat. The Boolean Satisfiability Problem. Sometimes called Propositional Satisfiability Problem. And abbreviated as SATISFIABILITY. Is the problem of determining if there exists an interpretation. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. 160;= TRUE and b.

martinfjohansen.com

SPLCATool

http://www.martinfjohansen.com/splcatool

Software Product Line Covering Array Tool (SPLCATool). Further development of SPLCATool is done in the Pairwiser Project. SPLCATool is a tool that implements various algorithms related to covering arrays. On this site you will find the tool and its source free of charge distributed under the Eclipse Public License. Documentation and User Manual. The documentation and user manual. For the latest version is available. (It was published as Appendix D of Martin Johansen's PhD thesis.). SPLCATool v0.3 (SP...

modelai.gettysburg.edu

Clue Deduction: an introduction to satisfiability reasoning

http://modelai.gettysburg.edu/2011/clue/index.html

Clue Deduction - The popular boardgame Clue. Aka Cluedo) serves as a fun focus problem for this introduction to propositional knowledge representation and reasoning. Syntax and semantics of propositional logic, general logic terminology (e.g. model, (un)satisfiability, entailment, equivalence, soundness, and completeness), conjunctive normal form, proof by contradiction (a.k.a. reductio ad absurdum) using resolution theorem proving. Introductory Artificial Intellegence students. Advanced projects include...

ibis.inrialpes.fr

03. GNA : Genetic Network Analyzer

http://ibis.inrialpes.fr/article122.html?menu=menu4

Models : Development and reduction of models of bacterial regulatory networks. Methods : Analysis and simulation of bacterial regulatory networks. Data : High-precision measurements of gene expression in bacteria. GNA : Genetic Network Analyzer. ISee : In Silico biology e-learning environment. Procrustes : Pattern-based property editor. WellInverter : web application for analyzing reporter gene data. WellReader : Analysis of fluorescence and luminescence reporter gene data. Software and database releases.

krportal.org

KRportal - Resources

http://www.krportal.org/resources

Calendar export of events. Thursday, 19 May 2016. Events are now available as an iCalendar. For subscription and as a Google calendar. For viewing in your web browser. Wednesday, 20 January 2016. Initial content added to the Resources section. Monday, 2 November 2015. The website now features a deadline timeline on the right-hand side. This page lists pages on the web relevant for KR researchers and grouped by categories. You can suggest new resources to be added by filling out the corresponding form.