Sciweavers

IANDC
2006
102views more  IANDC 2006»
13 years 7 months ago
Modular proof systems for partial functions with Evans equality
The paper presents a modular superposition calculus for the combination of firstorder theories involving both total and partial functions. The modularity of the calculus is a cons...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
FUIN
2006
112views more  FUIN 2006»
13 years 7 months ago
A Calculus of Looping Sequences for Modelling Microbiological Systems
Abstract. The paper presents a new calculus suitable to describe microbiological systems and their evolution. We use the calculus to model interactions among bacteria and bacteriop...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
Inductive types in the Calculus of Algebraic Constructions
In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), the basis of the proof assistant Coq, can be seen as a Calculus of Algebraic Constru...
Frédéric Blanqui
ENTCS
2008
96views more  ENTCS 2008»
13 years 7 months ago
Undecidability of Model Checking in Brane Logic
The Brane Calculus is a calculus intended to model the structure and the dynamics of biological membranes. In order to express properties of systems in this calculus, in previous ...
Giorgio Bacci, Marino Miculan
ENTCS
2008
106views more  ENTCS 2008»
13 years 7 months ago
Towards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
ENTCS
2008
83views more  ENTCS 2008»
13 years 7 months ago
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
In [24] the authors studied the expressiveness of persistence in the asynchronous -calculus (A) wrt weak barbed congruence. The study is incomplete because it ignores the issue of...
Diletta Cacciagrano, Flavio Corradini, Jesú...
DEDS
2008
108views more  DEDS 2008»
13 years 7 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
DAM
2008
99views more  DAM 2008»
13 years 7 months ago
Boundary value problems on weighted networks
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
Enrique Bendito, Angeles Carmona, Andrés M....
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 7 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 7 months ago
The Lambek-Grishin calculus is NP-complete
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
Jeroen Bransen