The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...