First-order theorem proving (FTP) is among the most traditional disciplines in Artificial Intelligence. Its roots date back to the 1960s, which brought us milestones like the Davis-Putnam-Logemann-Loveland procedure for propositional logic and the resolution calculus for the first order logic. Since
โฆ LIBER โฆ
First-order theorem proving: Foreword
โ Scribed by Nicolas Peltier; Viorica Sofronie-Stokkermans
- Book ID
- 113756565
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 139 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Preface to First order theorem proving
โ
Peter Baumgartner; Hantao Zhang
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 23 KB
Special Issue on Advances in First-order
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 73 KB
The role of first-order theorem proving as a core theme of automated deduction has been recognized since the beginning of the field, at the dawn of artificial intelligence, more than 40 years ago. Although many other logics have been developed and used in AI, deduction systems based on first-order t
Well-Behaved Inference Rules for First-O
โ
Jinzhao Wu; Zhuojun Liu
๐
Article
๐
1998
๐
Springer Netherlands
๐
English
โ 138 KB
An approach to a systematic theorem prov
โ
W. Bibel
๐
Article
๐
1974
๐
Springer Vienna
๐
English
โ 860 KB
Ordering in mechanical geometry theorem
โ
Hongbo Li
๐
Article
๐
1997
๐
SP Science China Press
๐
English
โ 534 KB
First-Order Logic and Automated Theorem
โ
G.-C. Rota
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 41 KB