Theoretical Computer Science - Proceedings Of The 4th Italian Conference

An algebraic framework for generalized semantics of logic programs, M. Gabbrielli et al; an incremental semantics for CLP(AD), E. Bertino et al; k mu-DNF formulae are learnable under product distribution, M. Flammini; maximal repetition of subwords in DOL languages (abstract), F. Mignosi amd D. Seebold; towards more realistic models of parallel computers (abstract), A.K. Chandra; an extensional formulation of ST Bisimulation, R. Gorrieri and C. Laneve; reversible simulation of space-bounded computation, P. Crescenzi and C.H. Papadimitriou; on reductions and approximations in parallel algebraic complexity, B. Codenotti et al. (Part contents)