Algorithmic Dependent-Type Theory of Situated Information and Context Assessments

1. Barwise, J., Perry, J.: Situations and Attitudes. The Hume Series. CSLI Publications, Stanford, California (1999)

   Google Scholar 

2. Loukanova, R.: Situation theory, situated information, and situated agents. In: Nguyen, N., et al. (eds.) Transactions on Computational Collective Intelligence XVII, Lecture Notes in Computer Science, vol. 8790, pp. 145–170. Springer, Berlin, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44994-3_8

3. Loukanova, R.: Typed theory of situated information and its application to syntax-semantics of human language. In: Christiansen, H., Jiménez-López, M.D., Loukanova, R., Moss, L.S. (eds.) Partiality and Underspecification in Information, Languages, and Knowledge, pp. 151–188. Cambridge Scholars Publishing, Cambridge. https://www.cambridgescholars.com/product/978-1-4438-7947-7 (2017)

4. Loukanova, R.: Computational syntax-semantics interface with type-theory of acyclic recursion for underspecified semantics. In: Osswald, R., Retoré, C., Sutton, P. (eds.) IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures. Proceedings of the Workshop, pp. 37–48. The Association for Computational Linguistics (ACL). https://www.aclweb.org/anthology/W19-1005 (2019)

5. Loukanova, R.: Formalisation of situated dependent-type theory with underspecified assessments. In: Bucciarelli, E., et al. (eds.) Decision Economics. Designs, Models, and Techniques for Boundedly Rational Decisions. DCAI 2018. Advances in Intelligent Systems and Computing, vol. 805, pp. 49–56. Springer International Publishing, Cham (2019). https://doi.org/10.1007/978-3-319-99698-1_6

6. Loukanova, R.: Gamma-reduction in type theory of acyclic recursion. Fundamenta Informaticae 170(4), 367–411 (2019). https://doi.org/10.3233/FI-2019-1867

   Article  MathSciNet  MATH  Google Scholar 

7. Loukanova, R.: Gamma-star canonical forms in the type-theory of acyclic algorithms. In: van den Herik, J., Rocha, A.P. (eds.) Agents and Artificial Intelligence, pp. 383–407. Springer International Publishing, Cham (2019). https://doi.org/10.1007/978-3-030-05453-3_18

8. Loukanova, R.: Type-theory of acyclic algorithms for models of consecutive binding of functional neuro-receptors. In: Grabowski, A., Loukanova, R., Schwarzweller, C. (eds.) AI Aspects in Reasoning, Languages, and Computation, vol. 889, pp. 1–48. Springer International Publishing, Cham (2020). https://doi.org/10.1007/978-3-030-41425-2_1

9. Loukanova, R.: Type-theory of parametric algorithms with restricted computations. In: 17th International Conference on Distributed Computing and Artificial Intelligence, pp. 321–331. Springer International Publishing, Cham (2021). https://doi.org/10.1007/978-3-030-53036-5_35. Accessed 07 August 2020

10. Moschovakis, Y.N.: The formal language of recursion. J. Symb. Logic 54(04), 1216–1252 (1989). https://doi.org/10.1017/S0022481200041086

    Article  MathSciNet  MATH  Google Scholar 

11. Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguist. Philos. 29(1), 27–89 (2006). https://doi.org/10.1007/s10988-005-6920-7

    Article  Google Scholar 

12. Müller, S.: Grammatical theory: from transformational grammar to constraint-based approaches. No. 1 in Textbooks in Language Sciences, Language Science Press, Berlin (2020). https://doi.org/10.5281/zenodo.3992307. https://langsci-press.org/catalog/book/287

13. Seligman, J., Moss, L.S.: Situation theory. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 253–329. Elsevier, Amsterdam (2011)

    Chapter  Google Scholar 

Download references