Publications

Export 128 results:
Sort by: Author Title Type [ Year (Asc)]
1985
Ambriola, V, Giannotti F, Pedreschi D, Turini F.  1985.  Symbolic Semantics and Program Reduction. IEEE Trans. Software Eng.. 11:784-794.
Albano, A, Giannotti F, Orsini R, Pedreschi D.  1985.  The Type System of Galileo. Data Types and Persistence (Appin), Informal Proceedings. :175-195.
Albano, A, Giannotti F, Orsini R, Pedreschi D.  1985.  The Type System of Galileo. Data Types and Persistence (Appin). :101-119.
1987
Barbuti, R, Mancarella P, Pedreschi D, Turini F.  1987.  Intensional Negation of Logic Programs: Examples and Implementation Techniques. TAPSOFT, Vol.2. :96-110.
Giannotti, F, Matteucci A, Pedreschi D, Turini F.  1987.  Symbolic Evaluation with Structural Recursive Symbolic Constants. Sci. Comput. Program.. 9:161-177.
1988
Mancarella, P, Pedreschi D.  1988.  An Algebra of Logic Programs. ICLP/SLP. :1006-1023.
Mancarella, P, Martini S, Pedreschi D.  1988.  Complete Logic Programs with Domain-Closure Axiom. J. Log. Program.. 5:263-276.
Bertolino, B, Mancarella P, Meo L, Nini L, Pedreschi D, Turini F.  1988.  A Progress Report on the LML Project. FGCS. :675-684.
1990
Mancarella, P, Pedreschi D, Rondinelli M, Tagliatti M.  1990.  Algebraic Properties of a Class of Logic Programs. NACLP. :23-39.
Giannotti, F, Pedreschi D.  1990.  Declarative Semantics for Pruning Operators in Logic Programming. LPNMR. :27-37.
Brogi, A, Mancarella P, Pedreschi D, Turini F.  1990.  Logic Programming within a Functional Framework. PLILP. :372-386.
Barbuti, R, Mancarella P, Pedreschi D, Turini F.  1990.  A Transformational Approach to Negation in Logic Programming. J. Log. Program.. 8:201-228.
Brogi, A, Mancarella P, Pedreschi D, Turini F.  1990.  Universal Quantification by Case Analysis. ECAI. :111-116.
1991
Giannotti, F, Pedreschi D, Saccà D, Zaniolo C.  1991.  Non-Determinism in Deductive Databases. DOOD. :129-146.
Apt, KR, Pedreschi D.  1991.  Proving Termination of General Prolog Programs. TACS. :265-289.
Brogi, A, Mancarella P, Pedreschi D, Turini F.  1991.  Theory Construction in Computational Logic. ICLP Workshop on Construction of Logic Programs. :241-250.
1992
Brogi, A, Mancarella P, Pedreschi D, Turini F.  1992.  Meta for Modularising Logic Programming. META. :105-119.
Bertolino, B, Meo L, Pedreschi D, Turini F.  1992.  The Type System of LML. Types in Logic Programming. :313-332.
1993
Corciulo, L, Giannotti F, Pedreschi D.  1993.  Datalog with Non-Deterministic Choice Computes NDB-PTIME. DOOD. :49-66.
Apt, KR, Pedreschi D.  1993.  Reasoning about Termination of Pure Prolog Programs. Inf. Comput.. 106:109-157.
1994
Corciulo, L, Giannotti F, Pedreschi D, Zaniolo C.  1994.  Expressive Power of Non-Deterministic Operators for Logic-based Languages. Workshop on Deductive Databases and Logic Programming. :27-40.
Brogi, A, Chiarelli A, Mancarella P, Mazzotta V, Pedreschi D, Renso C, Turini F.  1994.  Implementations of Program Composition Operations. PLILP. :292-307.
Brogi, A, Chiarelli A, Mancarella P, Mazzotta V, Pedreschi D, Renso C, Turini F.  1994.  Implementations of Program Composition Operations. PLILP. :292-307.
Brogi, A, Mancarella P, Pedreschi D, Turini F.  1994.  Modular Logic Programming. ACM Trans. Program. Lang. Syst.. 16:1361-1398.
Pedreschi, D.  1994.  A Proof Method for Runtime Properties of Prolog Programs. ICLP. :584-598.