Sciweavers

129 search results - page 22 / 26
» Completeness Results for Linear Logic on Petri Nets
Sort
View
LICS
2006
IEEE
14 years 1 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco
DAC
2003
ACM
14 years 21 days ago
Efficient compression and application of deterministic patterns in a logic BIST architecture
We present a novel method to efficiently generate, compress and apply test patterns in a logic BIST architecture. Patterns are generated by a modified automatic test pattern gener...
Peter Wohl, John A. Waicukauski, Sanjay Patel, Min...
WSC
2008
13 years 9 months ago
Discrete Rate Simulation using linear programming
Discrete Rate Simulation (DRS) is a modeling methodology that uses event based logic to simulate linear continuous processes and hybrid systems. These systems are concerned with t...
Cecile Damiron, Anthony Nastasi
ICLP
2004
Springer
14 years 25 days ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
FOSSACS
2010
Springer
13 years 10 months ago
Linearly-Used Continuations in the Enriched Effect Calculus
Abstract. The enriched effect calculus is an extension of Moggi's computational metalanguage with a selection of primitives from linear logic. In this paper, we present an ext...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...