An open API service indexing awesome lists of open source software.

https://github.com/konn/herbrand

An experiment around automated theorem proving in Haskell
https://github.com/konn/herbrand

Last synced: about 1 month ago
JSON representation

An experiment around automated theorem proving in Haskell

Awesome Lists containing this project

README

        

# Herbrand - Playground for experimenting with decision procedures in Haskell

## References

- A. Zeljić: "[_CS 357 Advanced Topics in Formal Methods_](https://web.stanford.edu/class/cs357/)".
- G. Nelson and D. C. Oppen: "[_Fast Decision Procedures Based on Congruence Closure_](https://dl.acm.org/doi/10.1145/322186.322198)".
- P. J. Downey, R. Sethi, and R. E. Tarjan: "[_Variations on the Common Subexpression Problem_](https://dl.acm.org/doi/10.1145/322217.322228)".
- D. C. Oppen: "[_Complexity, Convexity and Combinations of Theories_](https://courses.engr.illinois.edu/cs576/sp2017/readings/31-may-02/oppen-convex.pdf)"
- M. Willsey, C.Nandi, Y. R. Wang, O. Flatt, Z. Tatlock, and P. Panchekha: "[_egg: Fast and Extensible Equality Saturation_](https://dl.acm.org/doi/10.1145/3434304)". POPL '21.
- R. Mesquita: "[_hegg: Fast equality saturation in Haskell_](https://github.com/alt-romes/hegg)".
- H. Nabeshima and T. Soh: "[__高速 SAT ソルバーの原理__ (_Principles of Modern SAT Solvers_)](https://www.jstage.jst.go.jp/article/jjsai/25/1/25_68/_article/-char/ja/)".
- K. Iwanuma and H. Nabeshima: [__SMT: 個別理論を取り扱うSAT技術__ (_SMT: Satisfiability Modulo Theories_)](https://www.jstage.jst.go.jp/article/jjsai/25/1/25_86/_article/-char/ja/).
- H. H. Hoos and T. Stützle: "[_SATLib_](https://www.cs.ubc.ca/~hoos/SATLIB/benchm.html)".
- E. Torlak: "[_A Modern SAT Solver_](https://courses.cs.washington.edu/courses/cse507/17wi/lectures/L02.pdf)". In the course material of "[_CSE 507: Computer-Aided Reasoning for Software_](https://courses.cs.washington.edu/courses/cse507/14au/index.html)".
- J. H. Liang, V. Ganesh, E. Zulkoski, A. Zaman, and K. Czarnecki: "[_Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers_](https://mk.cs.msu.ru/images/1/1f/SAT_SMT_Vijay_Ganesh_HVC2015.pdf)".
- H. Wu: "[_Randomization and Restart Strategies_](https://cs.uwaterloo.ca/~vanbeek/Publications/wu.pdf)". Master's Thesis. 2006