TPTP
TPTP (Thousands of Problems for Theorem Provers) – biblioteka problemów dla systemów automatycznego dowodzenia twierdzeń[1]. Obejmuje ponad 15 tysięcy problemów abstrakcyjnych[2].
Biblioteka operuje własnym językiem Typed Higher-order Form (THF), który jest czytelny dla ludzi, łatwo parsowalny dla komputerów i bazuje na Prologu. Są na niej oparte problemy rozwiązaywane podczas konkursu CADE ATP System Competition[1][3].
Przypisy
- ↑ a b Geoff Sutcliffe, Christoph Benzmueller, Chad E. Brown, Frank Theiss, Progress in the Development of Automated Theorem Proving for Higher-order Logic, DOI: 10.1007/978-3-642-02959-2_8 (ang.).
- ↑ Inside the TPTP. tptp.org. [dostęp 2024-04-19]. (ang.).
- ↑ M. Saqib Nawaz, Moin Malik, Yi Li, Meng Sun, M. Ikram Ullah Lali, A Survey on Theorem Provers in Formal Methods, DOI: 10.48550/arXiv.1912.03028 (ang.).
Linki zewnętrzne
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.