Automated Theorem Proving
Automated Theorem Proving (ATP) is a field of artificial intelligence and mathematical logic dedicated to mechanically proving mathematical theorems in formal systems. Developed by John Robinson in 1965 with the resolution principle, ATP underpins modern verification tools like SAT/SMT solvers and is foundational to formal software verification, hardware validation, and mathematics.
Kilderegistrering
Citater kopieret ordret fra metodens kilderegistrering. Ingen påstandsniveauverifikation er udledt heraf.
- Robinson, J. A. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1), 23–41. · DOI 10.1145/321250.321253
- Fitting, M. (1996). First-Order Logic and Automated Theorem Proving (2nd ed.). Springer. · DOI 10.1007/978-1-4612-2360-3
- Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006). Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T). Journal of the ACM, 53(6), 937–977. · DOI 10.1145/1217856.1217859
Kuraterede påstande
Påstande gemt i bevis-loggen, hver med sin egen vurdering.
Denne visning opfinder ikke en påstandsvurdering, når loggen ingen har.
Relaterede metoder
Genereret fra metodegrafen og vist som maskinelt foreslåede relationer — ingen bevispåstand er udledt.
Den genererede relationsgraf har ingen udgående relation for denne metode.