Sciweavers

174 search results - page 4 / 35
» Loop Calculus for Satisfiability
Sort
View
ENTCS
2008
98views more  ENTCS 2008»
14 years 11 months ago
A Rewriting Calculus for Multigraphs with Ports
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
Oana Andrei, Hélène Kirchner
DLOG
2008
15 years 1 months ago
A Hybrid Tableau Algorithm for ALCQ
Abstract. We propose an approach for extending a tableau-based satisfiability algorithm by an arithmetic component. The result is a hybrid satisfiability algorithm for the Descript...
Jocelyne Faddoul, Nasim Farsinia, Volker Haarslev,...
ISCC
2005
IEEE
15 years 4 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
15 years 4 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...
ENTCS
2008
96views more  ENTCS 2008»
14 years 11 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