10271 search results - page 538 / 2055 » Computer Science |
167
click to vote
CAAP
1990
15 years 10 months ago
1990
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...
164
click to vote
RTA
1987
Springer
15 years 10 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
162
click to vote
STACS
1987
Springer
15 years 10 months ago
1987
Springer
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...
222
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
158
click to vote
AAAI
2008
15 years 9 months ago
2008
Game theory has been playing an increasingly visible role in computer science in general and AI in particular, most notably in the area of multiagent systems. I briefly list the a...