Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
Granular computing concerns human thinking and problem solving, as well as their implications to the design of knowledge intensive systems. It simplifies complex real world probl...
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences ...
Mehdi Dastani, Guido Governatori, Antonino Rotolo,...
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...