Authors: APT KR GABBRIELLI M PEDRESCHI D

Citation: Kr. Apt et al., A CLOSER LOOK AT DECLARATIVE INTERPRETATIONS, The journal of logic programming, 28(2), 1996, pp. 147-180

Authors: APT KR

Citation: Kr. Apt, ARRAYS, BOUNDED QUANTIFICATION AND ITERATION IN LOGIC AND CONSTRAINT LOGIC PROGRAMMING, Science of computer programming, 26(1-3), 1996, pp. 133-148

Authors: APT KR BOAS PV WELLING A

Citation: Kr. Apt et al., THE STO-PROBLEM IS NP-HARD, Journal of symbolic computation, 18(5), 1994, pp. 489-495

Authors: APT KR PELLEGRINI A

Citation: Kr. Apt et A. Pellegrini, ON THE OCCUR-CHECK-FREE PROLOG PROGRAMS, ACM transactions on programming languages and systems, 16(3), 1994, pp. 687-726

Authors: APT KR PEDRESCHI D

Citation: Kr. Apt et D. Pedreschi, REASONING ABOUT TERMINATION OF PURE PROLOG PROGRAMS, Information and computation, 106(1), 1993, pp. 109-157