GRUNGE: A Grand Unified ATP Challenge
@inproceedings{Brown2019GRUNGEAG, title={GRUNGE: A Grand Unified ATP Challenge}, author={C. Brown and T. Gauthier and C. Kaliszyk and G. Sutcliffe and J. Urban}, booktitle={CADE}, year={2019} }
This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type variables) and first-order logic (possibly with multiple types, and possibly with type variables). The resultant problem sets allow us to run automated theorem provers that support different logical formats on corresponding problems, and compare their performances… CONTINUE READING
12 Citations
Extensional Paramodulation for Higher-Order Logic and Its Effective Implementation Leo-III
- Computer Science
- KI - Künstliche Intelligenz
- 2019
- 10
- PDF
Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II
- Computer Science
- IJCAR
- 2020
Designing normative theories for ethical and legal reasoning: LogiKEy framework, methodology, and tool support
- Computer Science
- Artif. Intell.
- 2020
- 7
References
SHOWING 1-10 OF 52 REFERENCES
SMT solvers: new oracles for the HOL theorem prover
- Computer Science
- International Journal on Software Tools for Technology Transfer
- 2011
- 29
- PDF
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)
- Computer Science
- IJCAR
- 2008
- 93
- PDF
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs
- Computer Science
- LPAR
- 2007
- 111
- PDF
Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions
- Computer Science
- CPP
- 2016
- 6