Skip to main content
SpringerLink
Log in

DiMo – Discrete Modelling Using Propositional Logic

  • Conference paper
  • First Online:
Theory and Applications of Satisfiability Testing – SAT 2021 (SAT 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12831))

Abstract

We present a learning tool that addresses competences in using propositional logic for modelling purposes. It provides a language for specifying parametrised propositional formula schemes, a backend tool using an incremental SAT solver to exemplify instances of such a scheme to a user learning how to write correct propositional formulas, and a web-based frontend for easy access.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

Institutional subscriptions

Notes

  1. 1.

    https://github.com/muldvarp/DiMo.

  2. 2.

    https://www.typescriptlang.org, https://angular.io, https://www.docker.com, https://microsoft.github.io/monaco-editor, https://www.antlr.org, https://katex.org, https://nodejs.org, https://expressjs.com.

  3. 3.

    https://syre.fm.cs.uni-kassel.de/Georg/dimotoolweb.

  4. 4.

    https://dumbarton.fm.cs.uni-kassel.de.

References

  1. Anderson, J.R., Corbett, A.T., Koedinger, K.R., Pelletier, R.: Cognitive tutors: lessons learned. J. Learn. Sci. 4(2), 167–207 (1995)

    Article  Google Scholar 

  2. Clarke, E.M., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods Syst. Des. 19(1), 7–34 (2001)

    Article  Google Scholar 

  3. Geck, G., Ljulin, A., Peter, S., Schmidt, J., Vehlken, F., Zeume, T.: Introduction to Iltis: an interactive, web-based system for teaching logic. In: Proceedings 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, ITiCSE 2018, pp. 141–146. ACM (2018)

    Google Scholar 

  4. Green, T.R.G.: Cognitive dimensions of notations. In: People and Computers V, pp. 443–460. University Press (1989)

    Google Scholar 

  5. Green, T.R.G.: Instructions and descriptions: some cognitive aspects of programming and similar activities. In: Proceedings of Working Conference on Advanced Visual Interfaces, AVI 2000, pp. 21–28. ACM (2000)

    Google Scholar 

  6. Järvisalo, M., Berre, D.L., Roussel, O., Simon, L.: The international SAT solver competitions. AI Mag. 33(1), 89–92 (2012)

    Google Scholar 

  7. Joint Task Force on Computing Curricula, ACM and IEEE Computer Society. Computer Science Curricula 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science. ACM (2013)

    Google Scholar 

  8. Kautz, H.A., Selman, B.: Planning as satisfiability. In: Proceedings of 10th European Conference on Artificial Intelligence, ECAI 1992, pp. 359–363 (1992)

    Google Scholar 

  9. Lange, M.: DiMo - a tool for discrete modelling using propositional logic (version 0.2.2) (2021). https://github.com/muldvarp/DiMo/blob/master/doc/dimo.pdf

  10. Massacci, F., Marraro, L.: Logical cryptanalysis as a SAT problem. J. Autom. Reasoning 24(1/2), 165–203 (2000)

    Article  MathSciNet  Google Scholar 

  11. Tseytin, G.S.: On the complexity of derivation in propositional calculus. In: Studies in Constructive Mathematics and Mathematical Logic II, volume 8 of Zapiski Nauchnykh Seminarov LOMI, pp. 235–259. Nauka (1968). (In Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science/Formal Methods, University of Kassel, Kassel, Germany

    Norbert Hundeshagen, Martin Lange & Georg Siebert

Authors
  1. Norbert Hundeshagen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Georg Siebert
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Lange .

Editor information

Editors and Affiliations

  1. Laboratoire MIS, University of Picardie Jules Verne, Amiens, France

    Chu-Min Li

  2. IIIA-CSIC, Spanish National Research Council (CSIC), Bellaterra, Barcelona, Spain

    Felip Manyà

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hundeshagen, N., Lange, M., Siebert, G. (2021). DiMo – Discrete Modelling Using Propositional Logic. In: Li, CM., Manyà, F. (eds) Theory and Applications of Satisfiability Testing – SAT 2021. SAT 2021. Lecture Notes in Computer Science(), vol 12831. Springer, Cham. https://doi.org/10.1007/978-3-030-80223-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-80223-3_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-80222-6

  • Online ISBN: 978-3-030-80223-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation