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...
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...
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...
Carsten Otto, Marc Brockschmidt, Christian von Ess...
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...
The authors present how the Institute for Research in Intelligent Systems (IRIS) at California State University, Chico (CSUC) provides access to robotics equipment to support cour...