201
click to vote
RTA
15 years 9 months ago
1991 Springer 
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
195
Voted
FOCS
15 years 9 months ago
1991 IEEE 
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
193
click to vote
STACS
15 years 9 months ago
1991 Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
186
click to vote
MFCS
15 years 9 months ago
1991 Springer 
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
180
Voted
STACS
15 years 9 months ago
1991 Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
|
Theoretical Computer Science