#### Filter Results:

#### Publication Year

1983

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

1 Abstract The most general notion of canonical model for a logic program with negation is the one of stable model 9]. In 7] the stable models of a logic program are characterized by the well-supported Herbrand models of the program, and a new xed point semantics that formalizes the bottom-up truth maintenance procedure of 4] is based on that… (More)

In this paper we give a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in… (More)

In this article we present the Biochemical Abstract Machine BIOCHAM and advocate its use as a formal modeling environment for networks biology. Biocham provides a precise semantics to biomolecular interaction maps. Based on this formal semantics, the Biocham system offers automated reasoning tools for querying the temporal properties of the system under all… (More)

This paper presents a connection between the intuitionis-tic fragment of a non-commutative version of linear logic introduced by the rst author (NLI) and concurrent constraint programming (CC). We reene existing logical characterizations of operational aspects of CC, by providing a logical interpretation of ner observable properties of CC programs, namely… (More)

There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of programming languages. On the other hand, the module constructs may interfere with the programming constructs, and may be redundant with the other scope mechanisms of a specific… (More)

We consider the problem of finding a cutset in a directed graph G = (V, E), i.e. a set of vertices that cuts all cycles in G. Finding a cutset of minimum cardinality is NP-hard. There exist several approximate and exact algorithms, most of them using graph reduction techniques. In this paper we propose a constraint programming approach to cutset problems… (More)

CLPGUI is a generic graphical user interface for visualizing and controlling the execution of constraint logic programs. CLPGUI has been designed to be used in different contexts: initially for teaching purposes, then for debugging complex programs of real-world scale, and recently for developing end-user interfaces. The challenge of developing a tool which… (More)