Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Roussanka Loukanova"'
Relationships between Specified and Underspecified Quantification by the Theory of Acyclic Recursion
Autor:
Roussanka LOUKANOVA
Publikováno v:
Advances in Distributed Computing and Artificial Intelligence Journal, Vol 5, Iss 4, Pp 19-42 (2016)
The paper introduces a technique for representing quantifier relations that can have different scope order depending on context. The technique is demonstrated by classes of terms denoting relations, where each of the arguments of a relation term is b
Externí odkaz:
https://doaj.org/article/fd01dfd22f374b3388336030b3717919
Autor:
José Manuel Machado, Pablo Chamoso, Guillermo Hernández, Grzegorz Bocewicz, Roussanka Loukanova, Esteban Jove, Angel Martin del Rey, Michela Ricca
Publikováno v:
Distributed Computing and Artificial Intelligence, Special Sessions, 19th International Conference ISBN: 9783031232091
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d27c017e28c25fe8d6e11b40e86a6e5
https://doi.org/10.1007/978-3-031-23210-7_23
https://doi.org/10.1007/978-3-031-23210-7_23
Autor:
Roussanka Loukanova
Publikováno v:
Distributed Computing and Artificial Intelligence, 19th International Conference ISBN: 9783031208584
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b835ab9688cf7e2ddeb89462dad3c95
https://doi.org/10.1007/978-3-031-20859-1_4
https://doi.org/10.1007/978-3-031-20859-1_4
Autor:
Roussanka Loukanova
Publikováno v:
Fundamenta Informaticae. 170:367-411
In this article, we introduce Moschovakis higher-order type theory of acyclic recursion L-ar(lambda) . We present the potentials of L-ar(lambda) for incorporating different reduction systems in L-a ...
Autor:
Roussanka Loukanova
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030530358
DCAI
DCAI
The paper extends the formal language and reduction calculus of Moschovakis type-theory of recursion, by adding a restrictor operator on terms with predicative constraints. Terms with restrictions over memory variables formalise inductive algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abfc815d415c3100f36e9ccb74dd835d
https://doi.org/10.1007/978-3-030-53036-5_35
https://doi.org/10.1007/978-3-030-53036-5_35