Underspecified Relations with a Formal Language of Situation Theory
Roussanka Loukanova · 2015
The paper is an introduction to a formal language of Situation Theory. The language provides algorithmic processing of situated information. We introduce specialized, restricted variables that are recursively constrained to satisfy type-theoretic conditions by restrictions and algorithmic assignments. The restricted variables designate recursively connected networks of memory locations for ‘saving’ parametric information that depends on situations and restrictions over objects. The formal definitions introduce richly informative typed language for classification and representation of underspecified, parametric, and partial information that is dependent on situations.