• Publications
  • Influence
Consistency of Clark's completion and existence of stable models
  • F. Fages
  • Computer Science
  • Methods Log. Comput. Sci.
  • 1992
  • 338
  • 41
BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge
TLDR
BIOCHAM provides tools and languages for describing protein networks with a simple and straightforward syntax, and for integrating biological properties into the model. Expand
  • 241
  • 17
  • PDF
Modelling and querying interaction networks in the biochemical abstract machine BIOCHAM
TLDR
We present a formal modelling environment for network biology, called the Biochemical Abstract Machine (BIOCHAM), which delivers precise semantics to biomolecular interaction maps. Expand
  • 164
  • 15
  • PDF
Modeling and querying biomolecular interaction networks
TLDR
We introduce a formalism to represent and analyze protein-protein and protein-DNA interaction networks. Expand
  • 193
  • 11
  • PDF
Linear Concurrent Constraint Programming: Operational and Phase Semantics
TLDR
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. Expand
  • 72
  • 10
  • PDF
Machine Learning Biochemical Networks from Temporal Logic Properties
TLDR
We show how the temporal logic language can be turned into a specification language. Expand
  • 129
  • 7
  • PDF
The Biochemical Abstract Machine BIOCHAM
TLDR
In this article we present the Biochemical Abstract Machine BIOCHAM and advocate its use as a formal modeling environment for networks biology. Expand
  • 92
  • 7
  • PDF
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
  • F. Fages
  • Computer Science
  • New Generation Computing
  • 1 May 1990
TLDR
We study a new fixpoint semantics for logic programs with negation. Expand
  • 36
  • 7
  • PDF
Constructive Negation by Pruning
  • F. Fages
  • Mathematics, Computer Science
  • J. Log. Program.
  • 1 August 1997
TLDR
We show that a simple concurrent pruning mechanism over standard SLD derivation trees provides a complete operational semantics for normal constraint logic programs (CLP) w.r.t. Fitting-Kunen's three-valued logic semantics. Expand
  • 63
  • 6
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
TLDR
In this paper, we derive from these results the strong (uniform computability) Turing completeness of chemical reaction networks over a finite set of molecular species under the differential semantics . Expand
  • 37
  • 6