3454 search results - page 222 / 691 » Modern computer algebra |
133
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...
169
click to vote
RELMICS
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
221
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
162
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
198
click to vote
CASC
2006
Springer
15 years 10 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...