You are here

Home

1992

Giannotti F, Latella D. Using Abstract Interpretation for Gate splitting in LOTOS Specifications. In WSA. 1992. pp. 194-204.
Brogi A, Mancarella P, Pedreschi D, Turini F. Meta for Modularising Logic Programming. In META. 1992. pp. 105-119.
Amato G, Giannotti F, Mainetto G. Analysis of Concurrent Transactions in a Functional Database Programming Language. In WSA. 1992. pp. 174-184.

1991

Brogi A, Mancarella P, Pedreschi D, Turini F. Theory Construction in Computational Logic. In ICLP Workshop on Construction of Logic Programs. 1991. pp. 241-250.
Apt KR, Pedreschi D. Proving Termination of General Prolog Programs. In TACS. 1991. pp. 265-289.
Giannotti F, Hermenegildo MV. A Technique for Recursive Invariance Detection and Selective Program Specification. In PLILP. 1991. pp. 323-334.
Giannotti F, Pedreschi D, Saccà D, Zaniolo C. Non-Determinism in Deductive Databases. In DOOD. 1991. pp. 129-146.

1990

Giannotti F, Pedreschi D. Declarative Semantics for Pruning Operators in Logic Programming. In LPNMR. 1990. pp. 27-37.
Bertazzoni C, Giannotti F. RASP: A Resource Allocator for Software Projects. In IEA/AIE (Vol. 2). 1990. pp. 628-637.
Brogi A, Mancarella P, Pedreschi D, Turini F. Universal Quantification by Case Analysis. In ECAI. 1990. pp. 111-116.

Pages