Machine learningLogic and Reasoning
Uthibitishaji wa Theoremi za Kiotomatiki
Uthibitishaji wa Theoremi za Kiotomatiki (ATP) ni taaluma ya akili bandia na mantiki ya hisabati iliyojitolea kuthibitisha theoremu za hisabati kwa mitambo katika mifumo rasmi. Iliyoundwa na John Robinson mnamo 1965 kwa kanuni ya azimio, ATP inasaidia zana za kisasa za uthibitishaji kama vile visuluhishi vya SAT/SMT na ni msingi wa uthibitishaji rasmi wa programu, uthibitishaji wa maunzi, na hisabati.
Soma mbinu kamili
Kwa wanachama pekee
IngiaIngia kwa akaunti ya bure ili kusoma sehemu hii.
Vyanzo
- 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 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Automated Theorem Proving (ATP). ScholarGate. https://scholargate.app/sw/numerical-methods/automated-theorem-proving
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →