Skip to main content

Satoulouse: The Computational Power of Propositional Logic Shown to Beginners

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 6680)


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 or Sudokus).


  • Teaching logic in computer science
  • SAT solvers
  • constraint solving

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Le Berre, D., Parrain, A.: The Sat4j library, release 2.2, system description. Journal on Satisfiability, Boolean Modeling and Computation 7, 59–64 (2010)

    Google Scholar 

  2. Bothner, P.: Kawa: compiling dynamic languages to the java vm. In: Proceedings of the Annual Conference on USENIX Annual Technical Conference, ATEC 1998 (1998)

    Google Scholar 

  3. Gusfield, D., Orzach, S.: Handbook on Computational Molecular Biology, vol. 9 (2005)

    Google Scholar 

  4. Marques-Silva, J.: Practical applications of boolean satisfiability. In: 9th International Workshop on Discrete Event Systems, WODES 2008, pp. 74–80. IEEE, Los Alamitos (2008)

    CrossRef  Google Scholar 

  5. Papadimitriou, C.H.: Computational complexity. Addison Wesley, Reading (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gasquet, O., Schwarzentruber, F., Strecker, M. (2011). Satoulouse: The Computational Power of Propositional Logic Shown to Beginners. In: Blackburn, P., van Ditmarsch, H., Manzano, M., Soler-Toscano, F. (eds) Tools for Teaching Logic. TICTTL 2011. Lecture Notes in Computer Science(), vol 6680. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21349-6

  • Online ISBN: 978-3-642-21350-2

  • eBook Packages: Computer ScienceComputer Science (R0)