Results 1  10
of
383
Linear Logic by Levels and Bounded Time Complexity
, 2009
"... This work deals with the characterization of elementary and deterministic polynomial time computation in linear logic through the proofsasprograms correspondence. Girard’s seminal results, concerning elementary and light linear logic, use a principle called stratification to ensure the complexity b ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This work deals with the characterization of elementary and deterministic polynomial time computation in linear logic through the proofsasprograms correspondence. Girard’s seminal results, concerning elementary and light linear logic, use a principle called stratification to ensure the complexity
Matching Events in a Contentbased Subscription System
, 2003
"... Contentbased subscription systems are an emerging alternative to traditional publishsubscribe systems, because they permit more flexible subscriptions along multiple dimensions. In these systems, each subscription is a predicate which may test arbitrary attributes within an event. However, the mat ..."
Abstract

Cited by 303 (8 self)
 Add to MetaCart
, the matching problem for contentbased systems  determining for each event the subset of all subscriptions whose predicates match the event  is still an open problem. We present an efficient, scalable solution to the matching problem. Our solution has an expected time complexity that is sublinear
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
complementary to Fourier preparation by linear field gradients. Thus, by using multiple receiver coils in parallel scan time in Fourier imaging can be considerably reduced. The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil
Abstract Expressing Heapshape Contracts in Linear Logic ∗
"... Contracts (dynamically checked programmer assertions) are a widely accepted mechanism for specifying, checking and documenting properties of software components. Most, if not all, contract systems expect programmers to use the native programming language to express their program invariants. While th ..."
Abstract
 Add to MetaCart
linear logic as a language of contracts for an imperative programming language. The highlevel nature of our linear logical contracts makes specifying memory shape and aliasing properties of complex recursive data structures easy. Moreover, since we give our logic a clear, compositional semantics
Expressing Heapshape Contracts in Linear Logic
"... Contracts (dynamically checked programmer assertions) are a widely accepted mechanism for specifying, checking and documenting properties of software components. Most, if not all, contract systems expect programmers to use the native programming language to express their program invariants. While th ..."
Abstract
 Add to MetaCart
linear logic as a language of contracts for an imperative programming language. The highlevel nature of our linear logical contracts makes specifying memory shape and aliasing properties of complex recursive data structures easy. Moreover, since we give our logic a clear, compositional semantics
Lazy theorem proving for bounded model checking over infinite domains
, 2002
"... Abstract. We investigate the combination of propositional SAT checkers with domainspecific theorem provers as a foundation for bounded model checking over infinite domains. Given a program M over an infinite state type, a linear temporal logic formula ' with domainspecific constraints over pr ..."
Abstract

Cited by 91 (11 self)
 Add to MetaCart
Abstract. We investigate the combination of propositional SAT checkers with domainspecific theorem provers as a foundation for bounded model checking over infinite domains. Given a program M over an infinite state type, a linear temporal logic formula ' with domainspecific constraints over
An Abstract Approach to Stratification in Linear Logic
"... Abstract We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cutelimination procedure (the socalled "light" subsystems), from an abstract point of view, introducing a logical system in which stratification is handled by a separa ..."
Abstract
 Add to MetaCart
Abstract We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cutelimination procedure (the socalled "light" subsystems), from an abstract point of view, introducing a logical system in which stratification is handled by a
The complexity of model checking higher order fixpoint logic
 In Proc. 30th Int. Symp. on Math. Foundations of Computer Science, MFCS’05, volume 3618 of LNCS
, 2005
"... Abstract. This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µcalculus enriched with a typed λcalculus. It is hard for every level of the elementary time/space hierarchy and in elementary time/space when restricted to formulas ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Abstract. This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µcalculus enriched with a typed λcalculus. It is hard for every level of the elementary time/space hierarchy and in elementary time/space when restricted
Theoretical bounds on the complexity of inexact computations
 IEEE Trans. on Information Theory
, 1976
"... AbstractThis paper considers the reduction in algorithmic complexity that’can be achieved by permitting approximate answers to computational problems. It is shown that Shannon’s ratedistortion function could, under quite general conditions, provide lower bounds on the mean complexity of inexact c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
AbstractThis paper considers the reduction in algorithmic complexity that’can be achieved by permitting approximate answers to computational problems. It is shown that Shannon’s ratedistortion function could, under quite general conditions, provide lower bounds on the mean complexity of inexact
Bounded treewidth as a key to tractability of knowledge representation and reasoning
 IN PROCEEDINGS OF THE 21ST NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI’06
, 2006
"... Several forms of reasoning in AI – like abduction, closed world reasoning, circumscription, and disjunctive logic programming – are well known to be intractable. In fact, many of the relevant problems are on the second or third level of the polynomial hierarchy. In this paper, we show how the powerf ..."
Abstract

Cited by 32 (16 self)
 Add to MetaCart
the powerful notion of treewidth can be fruitfully applied to this area. In particular, we show that all these problems become tractable (actually, even solvable in linear time), if the treewidth of the involved formulae (or of the disjunctive logic programs, resp.) is bounded by some constant. Experiments
Results 1  10
of
383