Sciweavers

1448 search results - page 24 / 290
» Restricted Stack Implementations
Sort
View
DLOG
2001
15 years 3 months ago
Combining Tableaux and Algebraic Methods for Reasoning with Qualified Number Restrictions
This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...
Volker Haarslev, Martina Timmann, Ralf Möller
DCC
2006
IEEE
16 years 1 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
CAV
2010
Springer
198views Hardware» more  CAV 2010»
15 years 5 months ago
Automatically Proving Linearizability
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
Viktor Vafeiadis
ECAI
2004
Springer
15 years 7 months ago
Tractable Symmetry Breaking Using Restricted Search Trees
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...
ENTCS
2006
125views more  ENTCS 2006»
15 years 1 months ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy