Authors: GIANNOTTI F PEDRESCHI D

Citation: F. Giannotti et D. Pedreschi, DATALOG WITH NONDETERMINISTIC CHOICE COMPUTES NDB-PTIME, The journal of logic programming, 35(1), 1998, pp. 79-101

Authors: PEDRESCHI D RUGGIERI S

Citation: D. Pedreschi et S. Ruggieri, WEAKEST PRECONDITIONS FOR PURE PROLOG PROGRAMS, Information processing letters, 67(3), 1998, pp. 145-150

Authors: PEDRESCHI D SUBRAHMANIAN VS

Citation: D. Pedreschi et Vs. Subrahmanian, NONDETERMINISM IN DATABASES - PREFACE, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 1-2

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: BROGI A MANCARELLA P PEDRESCHI D TURINI F

Citation: A. Brogi et al., MODULAR LOGIC PROGRAMMING, ACM transactions on programming languages and systems, 16(4), 1994, pp. 1361-1398

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