LOGIC PROGRAMMING AS A BASIS FOR LEAN AUTOMATED DEDUCTION

Authors
BECKERT B POSEGGA J
Citation
B. Beckert et J. Posegga, LOGIC PROGRAMMING AS A BASIS FOR LEAN AUTOMATED DEDUCTION, The journal of logic programming, 28(3), 1996, pp. 231-236
Citations number
11
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Theory & Methods
Journal title
The journal of logic programming → ACNP
ISSN journal
07431066
Volume
28
Issue
3
Year of publication
1996
Pages
231 - 236
Database
ISI
SICI code
0743-1066(1996)28:3<231:LPAABF>2.0.ZU;2-O
Abstract
The idea of lean deduction is to achieve maximal efficiency from minim al means. Every possible effort is made to eliminate overhead. Logic p rogramming languages provide an ideal tool for implementing lean deduc tion as they offer a level of abstraction that is close to the needs f or building first-order deduction systems. In this paper, we describe the principle of lean deduction and present leanT(A)P, an instance of it implemented in standard Prolog.