Sciweavers

842 search results - page 86 / 169
» Linear logic
Sort
View
CSL
2009
Springer
14 years 3 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
PODC
2012
ACM
11 years 11 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
IWFM
2003
172views Formal Methods» more  IWFM 2003»
13 years 10 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
APAL
2008
80views more  APAL 2008»
13 years 9 months ago
System BV is NP-complete
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
Ozan Kahramanogullari
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 9 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini