Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
In this paper we present an overview of recent developments in the plan-based control of autonomous robots. We identify computational principles that enable autonomous robots to a...
Abstract. This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class co...