Sciweavers

887 search results - page 96 / 178
» A Science of Reasoning
Sort
View
LICS
2008
IEEE
14 years 3 months ago
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
Taolue Chen, Wan Fokkink
SSDBM
2008
IEEE
94views Database» more  SSDBM 2008»
14 years 3 months ago
A FUSE-Based Tool for Accessing Meteorological Data in Remote Servers
This paper describes a tool for providing transparent access to online meteorological databases by way of local file system. It is realized by FUSE, an implementation of usermode ...
Keiichirou Ui, Toshiyuki Amagasa, Hiroyuki Kitagaw...
HICSS
2007
IEEE
121views Biometrics» more  HICSS 2007»
14 years 3 months ago
Towards Co-Design of Business Processes and Information Systems Using Web Services
A variety of forces are constantly transforming enterprises, thus, requiring them to constantly adapt to changing business environment. This emergent state requires enterprises to...
Karthikeyan Umapathy
LICS
2007
IEEE
14 years 3 months ago
Categorical Combinatorics for Innocent Strategies
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former dis...
Russell Harmer, Martin Hyland, Paul-André M...
LICS
2007
IEEE
14 years 3 months ago
Tractability and learnability arising from algebras with few subpowers
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...