Sciweavers

884 search results - page 84 / 177
» A Proof Theory for DL-Lite
Sort
View
EATCS
2000
85views more  EATCS 2000»
15 years 6 months ago
A New Zero-One Law and Strong Extension Axioms
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
Andreas Blass, Yuri Gurevich
STTT
2010
122views more  STTT 2010»
15 years 4 months ago
Rodin: an open toolset for modelling and reasoning in Event-B
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B are the use of set theory as a modelling notation, the use of ent to represent systems a...
Jean-Raymond Abrial, Michael J. Butler, Stefan Hal...
POPL
2010
ACM
16 years 3 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 8 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
MOBIHOC
2007
ACM
16 years 5 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...