Several logical languages have been considered in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze both the expressiveness and ...
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
Abstract--With the growing computer networks, accessible data is becoming increasing distributed. Understanding and integrating remote and unfamiliar data sources are important dat...
Whena family of genes from closely related organisms is known,there is a certain chance to extract the corresponding gene from the genomeof another related organism. This can be d...
Robert Giegerich, Folker Meyer, Chris Schleiermach...
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...