We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Abstract. Research in many fields of AI, such as distributed planning and reasoning, agent teamwork and coalition formation, cooperative problem solving and action theory has adva...
Geocomputation has a long tradition in dealing with fuzzyness in different contexts, most notably in the challenges created by the representation of geographic space in digital for...