Satoulouse: The Computational Power of Propositional Logic Shown to Beginners.
ABSTRACT We present a tool (Satoulouse) that can help teachers, particularly in computer science, to convince undergraduate students that logic may be powerful.
It is to be used very early in a logic course, in order to enhance students’ motivation to learn propositional logic. Satoulouse simply consists of a friendly interface that offers several syntactic facilities and which is connected with a sufficiently
powerful SAT-prover (namely SAT4J) allowing to automatically solve big instances of difficult problems (such as time-tables
- SourceAvailable from: db.usenix.org[show abstract] [hide abstract]
Conference Proceeding: Practical applications of Boolean Satisfiability[show abstract] [hide abstract]
ABSTRACT: Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements since the mid 90s. One of the main reasons for these improvements has been the wide range of practical applications of SAT. Indeed, examples of modern applications of SAT range from termination analysis in term-rewrite systems to circuit-level prediction of crosstalk noise. The success of SAT solvers motivated many practical applications, but many practical applications have also provided the examples and the challenges that allowed the development of more efficient SAT solvers. This paper provides an overview of some of the most well-known applications of SAT and outlines several other successful applications of SAT. Moreover, the improvements in SAT solvers motivated the development of new algorithms for strategic extensions of SAT. As a result, the paper also provides a brief survey of recent work on extensions of SAT, including pseudo-Boolean constraints, maximum satisfiability, model counting and quantified Boolean formulas.Discrete Event Systems, 2008. WODES 2008. 9th International Workshop on; 06/2008
Conference Proceeding: On the Computational Complexity of theTheoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings; 01/2005