• Publications
  • Influence
Transformations of CLP Modules
We propose a transformation system for CLP programs and modules. The framework is inspired by the one of Tamaki and Sato for pure logic programs. However, the use of CLP allows us to introduce someExpand
  • 93
  • 17
The s-Semantics Approach: Theory and Applications
Abstract This paper is a general overview of an approach to the semantics of logic programs whose aim is to find notions of models which really capture the operational semantics, and are, therefore,Expand
  • 161
  • 16
Replication vs. Recursive Definitions in Channel Based Calculi
We investigate the expressive power of two alternative approaches used to express infinite behaviours in process calculi, namely, replication and recursive definitions. These two approaches areExpand
  • 63
  • 12
A Timed Concurrent Constraint Language
Abstract We study a timed concurrent constraint language, called tccp , which is obtained by a natural timed interpretation of the usual ccp constructs: action-prefixing is interpreted as theExpand
  • 70
  • 11
Comparing Recursion, Replication, and Iteration in Process Calculi
In [BGZ03] we provided a discrimination result between recursive definitions and replication in a fragment of CCS by showing that termination (i.e., all computations terminate) is undecidable in theExpand
  • 59
  • 11
Programming Languages: Principles and Paradigms
This self-contained textbook assumes that the reader has some familiarity with one programming language, and adopts a simple yet rigorous approach. The author explains the main programming paradigmsExpand
  • 52
  • 11
A Compositional Semantics for Logic Programs
Bossi, A., M. Gabbrielli, G. Levi and M.C. Meo, A compositional semantics for logic programs, Theoretical Computer Science 122 (1994) 3-47. This paper considers open logic programs originallyExpand
  • 72
  • 7
SUNNY: a Lazy Portfolio Approach for Constraint Solving
Within the context of constraint solving, a portfolio approach allows one to exploit the synergy between different solvers in order to create a globally better solver. In this paper we present SUNNY:Expand
  • 40
  • 7
Observable Semantics for Constraint Logic Programs
versions of the immediate consequence operators that we will introduce can be used for bottom-up abstract interpretation (i.e. xpoint computation of the abstract model). Abstract interpretation ofExpand
  • 42
  • 6
Modeling Answer Constraints in Constraint Logic Programs
The constraint logic programming paradigm CLP(X) (CLP for short) has been proposed by Jaaar and Lassez in order to integrate a generic computational mechanism based on constraints with the logicExpand
  • 49
  • 5