Sciweavers

2783 search results - page 196 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
SOFSEM
2009
Springer
15 years 6 months ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo
ECSQARU
2001
Springer
15 years 6 months ago
Reasoning about Knowledge Using Rough Sets
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
Weiru Liu
LICS
1994
IEEE
15 years 5 months ago
Categories, Allegories and Circuit Design
Relational languages such as Ruby are used to derive circuits from abstract speci cations of their behaviour. Much reasoning is done informally in Ruby using pictorial representat...
Carolyn Brown, Graham Hutton
SIGMOD
1989
ACM
153views Database» more  SIGMOD 1989»
15 years 5 months ago
Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and a...
Atsushi Ohori, Peter Buneman, Val Tannen
113
Voted
FOSSACS
2000
Springer
15 years 5 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin