Skip to main content
SpringerLink
Log in

Automated Generation of Exam Sheets for Automated Deduction

  • Conference paper
  • First Online:
Intelligent Computer Mathematics (CICM 2021)

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

Included in the following conference series:

Abstract

Amid the COVID-19 pandemic, distance teaching became default in higher education, urging teachers and researchers to revise course materials into an accessible online content for a diverse audience. Probably one of the hardest challenges came with online assessments of course performance, for example by organizing online written exams. In this teaching-related project paper we survey the setting we organized for our master’s level course “Automated Deduction” in logic and computation at TU Wien. The algorithmic and rigorous reasoning developed within our course called for individual exam sheets focused on problem solving and deductive proofs; as such exam sheets using test grids were not a viable solution for written exams within our course. We believe the toolchain of automated reasoning tools we have developed for holding online written exams could be beneficial not only for other distance learning platforms, but also to researchers in automated reasoning, by providing our community with a large set of randomly generated benchmarks in SAT/SMT solving and first-order theorem proving.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Institutional subscriptions

Notes

  1. 1.

    https://tiss.tuwien.ac.at/course/courseDetails.xhtml?dswid=2002&dsrid=601&courseNr=184774&semester=2020S.

  2. 2.

    I.e., an instance of an inference rule as opposed to the rule itself.

  3. 3.

    I.e., \(\overline{L} = \lnot L\) and \(\overline{\lnot L} = L\).

  4. 4.

    Note that for all values of i, \(w_{i, f}(f) = w_{i, g}(g)\) and \(w_{i, f}(g) = w_{i, g}(f)\), and the precedences \(p_{i, f}, p_{i, g}\) are the same except for the precedence of f, g. However, for convenience, the table contains both \(w_{i, f}\) and \(w_{i, g}\), as well as \(p_{i, f}\) and \(p_{i, g}\) for all values of i.

References

  1. Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: Version 2.6. Technical report, Department of Computer Science, The University of Iowa (2017). www.SMT-LIB.org

  2. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)

    Google Scholar 

  3. Claessen, K., Hughes, J.: Quickcheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of ICFP, pp. 268–279 (2000)

    Google Scholar 

  4. Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394–397 (1962)

    Article  MathSciNet  Google Scholar 

  5. Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): fast decision procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 175–188. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27813-9_14

    Chapter  Google Scholar 

  6. Gleiss, B., Kovács, L., Rath, J.: Subsumption demodulation in first-order theorem proving. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) Proceedings of IJCAR, pp. 297–315. Springer, Cham (2020)

    Google Scholar 

  7. Gulwani, S., Radicek, I., Zuleger, F.: Automated clustering and program repair for introductory programming assignments. In: Proceedings of PLDI, pp. 465–480 (2018)

    Google Scholar 

  8. Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press (1970)

    Google Scholar 

  9. Kovács, L., Voronkov, A.: First-order theorem proving and Vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1–35. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39799-8_1

    Chapter  Google Scholar 

  10. de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_24

    Chapter  Google Scholar 

  11. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst. 1(2), 245–257 (1979)

    Article  Google Scholar 

  12. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Handbook of Automated Reasoning, pp. 371–443 (2001)

    Google Scholar 

  13. Tinelli, C.: A DPLL-based calculus for ground satisfiability modulo theories. In: Proceedings of JELIA, pp. 308–319 (2002)

    Google Scholar 

  14. Tseytin, G.S.: On the complexity of derivation in propositional calculus. In: Studies in Constructive Mathematics and Mathematical Logic, pp. 115–1125. Steklov Mathematical Institute (1970)

    Google Scholar 

  15. Wang, K., Singh, R., Su, Z.: Search, align, and repair: data-driven feedback generation for introductory programming exercises. In: Proceedings of PLDI, pp. 481–495 (2018)

    Google Scholar 

Download references

Acknowledgments

We acknowledge funding supporting this work, in particular the ERC CoG ARTIST 101002685, the ERC StG 2014 SYMCAR 639270 and the Austrian FWF research project LogiCS W1255-N23.

Author information

Authors and Affiliations

  1. TU Wien, Vienna, Austria

    Petra Hozzová, Laura Kovács & Jakob Rath

Authors
  1. Petra Hozzová
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laura Kovács
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jakob Rath
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Petra Hozzová .

Editor information

Editors and Affiliations

  1. Heriot-Watt University, Edinburgh, UK

    Fairouz Kamareddine

  2. University of Bologna, Bologna, Italy

    Claudio Sacerdoti Coen

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

Hozzová, P., Kovács, L., Rath, J. (2021). Automated Generation of Exam Sheets for Automated Deduction. In: Kamareddine, F., Sacerdoti Coen, C. (eds) Intelligent Computer Mathematics. CICM 2021. Lecture Notes in Computer Science(), vol 12833. Springer, Cham. https://doi.org/10.1007/978-3-030-81097-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-81097-9_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-81096-2

  • Online ISBN: 978-3-030-81097-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation