Sciweavers

2373 search results - page 182 / 475
» On the Theory of Structural Subtyping
Sort
View
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
15 years 6 months ago
Cubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...
Sergei Ovchinnikov
APAL
1998
121views more  APAL 1998»
15 years 6 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
CADE
2007
Springer
16 years 7 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
SEMWEB
2009
Springer
16 years 1 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
ICPP
2008
IEEE
16 years 1 months ago
On Clustering Tasks in IC-Optimal Dags
Strategies are developed for “fattening” the tasks of computation-dags so as to accommodate the heterogeneity of remote clients in Internet-based computing (IC). Earlier work ...
Mark Sims, Gennaro Cordasco, Arnold L. Rosenberg