Sciweavers

728 search results - page 93 / 146
» A Logical Approach to Represent and Reason about Calendars
Sort
View
LICS
2010
IEEE
14 years 7 months ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius
INTERACT
2003
14 years 11 months ago
A Model-Based Approach for Engineering Multimodal Interactive Systems
Abstract: Representing the behaviour of multimodal interactive systems in a complete, concise and nonambiguous way is still a challenge for formal description techniques. Indeed, m...
Philippe A. Palanque, Amélie Schyn
DALT
2005
Springer
15 years 3 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
PPOPP
2012
ACM
13 years 5 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
ICFP
2009
ACM
15 years 10 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg