Publications

You are here

Home » Research
Export 5 results:
Author Title Type [ Year(Asc)]
Filters: Author is Pedreschi, Dino  [Clear All Filters]
1995
M. E. Carboni, Foddai, V., Giannotti, F., and Pedreschi, D., “Declarative Reconstruction of Updates in Logic Databases: a Compilative Approach”, in GULP-PRODE, 1995, pp. 169-182.
1994
L. Corciulo, Giannotti, F., Pedreschi, D., and Zaniolo, C., “Expressive Power of Non-Deterministic Operators for Logic-based Languages”, in Workshop on Deductive Databases and Logic Programming, 1994, pp. 27-40.
A. Brogi, Chiarelli, A., Mancarella, P., Mazzotta, V., Pedreschi, D., Renso, C., and Turini, F., “Implementations of Program Composition Operations”, pp. 292–307, 1994.
A. Brogi, Chiarelli, A., Mancarella, P., Mazzotta, V., Pedreschi, D., Renso, C., and Turini, F., “Implementations of Program Composition Operations”, in PLILP, 1994, pp. 292-307.
A. Brogi, Chiarelli, A., Mancarella, P., Mazzotta, V., Pedreschi, D., Renso, C., and Turini, F., “Implementations of Program Composition Operations”, in PLILP, 1994, pp. 292-307.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Modular Logic Programming”, ACM Trans. Program. Lang. Syst., vol. 16, pp. 1361-1398, 1994.
D. Pedreschi, “A Proof Method for Runtime Properties of Prolog Programs”, in ICLP, 1994, pp. 584-598.
P. Mascellani and Pedreschi, D., “Proving termination of Prolog programs”, in GULP-PRODE (1), 1994, pp. 46-61.
1993
L. Corciulo, Giannotti, F., and Pedreschi, D., “Datalog with Non-Deterministic Choice Computes NDB-PTIME”, in DOOD, 1993, pp. 49-66.
K. R. Apt and Pedreschi, D., “Reasoning about Termination of Pure Prolog Programs”, Inf. Comput., vol. 106, pp. 109-157, 1993.
1992
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Meta for Modularising Logic Programming”, in META, 1992, pp. 105-119.
B. Bertolino, Meo, L., Pedreschi, D., and Turini, F., The Type System of LML. 1992, pp. 313-332.
1991
F. Giannotti, Pedreschi, D., Saccà, D., and Zaniolo, C., “Non-Determinism in Deductive Databases”, in DOOD, 1991, pp. 129-146.
K. R. Apt and Pedreschi, D., “Proving Termination of General Prolog Programs”, in TACS, 1991, pp. 265-289.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Theory Construction in Computational Logic”, in ICLP Workshop on Construction of Logic Programs, 1991, pp. 241-250.
1990
P. Mancarella, Pedreschi, D., Rondinelli, M., and Tagliatti, M., “Algebraic Properties of a Class of Logic Programs”, in NACLP, 1990, pp. 23-39.
F. Giannotti and Pedreschi, D., “Declarative Semantics for Pruning Operators in Logic Programming”, in LPNMR, 1990, pp. 27-37.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Logic Programming within a Functional Framework”, in PLILP, 1990, pp. 372-386.
R. Barbuti, Mancarella, P., Pedreschi, D., and Turini, F., “A Transformational Approach to Negation in Logic Programming”, J. Log. Program., vol. 8, pp. 201-228, 1990.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Universal Quantification by Case Analysis”, in ECAI, 1990, pp. 111-116.
1988
P. Mancarella and Pedreschi, D., “An Algebra of Logic Programs”, in ICLP/SLP, 1988, pp. 1006-1023.
P. Mancarella, Martini, S., and Pedreschi, D., “Complete Logic Programs with Domain-Closure Axiom”, J. Log. Program., vol. 5, pp. 263-276, 1988.
B. Bertolino, Mancarella, P., Meo, L., Nini, L., Pedreschi, D., and Turini, F., “A Progress Report on the LML Project”, in FGCS, 1988, pp. 675-684.
1987
R. Barbuti, Mancarella, P., Pedreschi, D., and Turini, F., “Intensional Negation of Logic Programs: Examples and Implementation Techniques”, in TAPSOFT, Vol.2, 1987, pp. 96-110.
F. Giannotti, Matteucci, A., Pedreschi, D., and Turini, F., “Symbolic Evaluation with Structural Recursive Symbolic Constants”, Sci. Comput. Program., vol. 9, pp. 161-177, 1987.

Pages