Sciweavers

4397 search results - page 284 / 880
» Relational Algebra Operations
Sort
View
LICS
2009
IEEE
15 years 11 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
131
Voted
ESOP
2007
Springer
15 years 10 months ago
A Rewriting Semantics for Type Inference
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...
George Kuan, David MacQueen, Robert Bruce Findler
178
Voted
DALT
2005
Springer
15 years 10 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
144
Voted
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 10 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
151
Voted
CONCUR
2001
Springer
15 years 9 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...