Zobrazeno 1 - 10
of 845
pro vyhledávání: '"Găină, A."'
Autor:
Avram, Andrei-Marius, Timpuriu, Mircea, Iuga, Andreea, Matei, Vlad-Cristian, Tăiatu, Iulian-Marius, Găină, Tudor, Cercel, Dumitru-Clementin, Pop, Florin, Cercel, Mihaela-Claudia
Using supervised automatic summarisation methods requires sufficient corpora that include pairs of documents and their summaries. Similarly to many tasks in natural language processing, most of the datasets available for summarization are in English,
Externí odkaz:
http://arxiv.org/abs/2412.11317
Autor:
Eberhardinger, Manuel, Goodman, James, Dockhorn, Alexander, Perez-Liebana, Diego, Gaina, Raluca D., Çakmak, Duygu, Maghsudi, Setareh, Lucas, Simon
Large language models (LLMs) have shown impressive capabilities in generating program code, opening exciting opportunities for applying program synthesis to games. In this work, we explore the potential of LLMs to directly synthesize usable code for
Externí odkaz:
http://arxiv.org/abs/2412.04057
Autor:
Gaina, Daniel
We explore a simple approach to quantum logic based on hybrid and dynamic modal logic, where the set of states is given by some Hilbert space. In this setting, a notion of quantum clause is proposed in a similar way the notion of Horn clause is advan
Externí odkaz:
http://arxiv.org/abs/2406.13360
Ehrenfeucht-Fraisse games provide means to characterize elementary equivalence for first-order logic, and by standard translation also for modal logics. We propose a novel generalization of Ehrenfeucht- Fraisse games to hybrid-dynamic logics which is
Externí odkaz:
http://arxiv.org/abs/2406.02094
Autor:
Gaina, Daniel
The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states in a natur
Externí odkaz:
http://arxiv.org/abs/2406.02085
Modern Tabletop Games present various interesting challenges for Multi-agent Reinforcement Learning. In this paper, we introduce PyTAG, a new framework that supports interacting with a large collection of games implemented in the Tabletop Games frame
Externí odkaz:
http://arxiv.org/abs/2405.18123
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition relations, which ar
Externí odkaz:
http://arxiv.org/abs/2404.16111
There are known characterisations of several fragments of hybrid logic by means of invariance under bisimulations of some kind. The fragments include $\{\store, \jump\}$ with or without nominals (Areces, Blackburn, Marx), $\jump$ with or without nomi
Externí odkaz:
http://arxiv.org/abs/2312.14661
Autor:
Balla, Martin, Long, George E. M., Jeurissen, Dominik, Goodman, James, Gaina, Raluca D., Perez-Liebana, Diego
In recent years, Game AI research has made important breakthroughs using Reinforcement Learning (RL). Despite this, RL for modern tabletop games has gained little to no attention, even when they offer a range of unique challenges compared to video ga
Externí odkaz:
http://arxiv.org/abs/2307.09905
In this paper we prove a Robinson consistency theorem for a class of many-sorted hybrid logics as a consequence of an Omitting Types Theorem. An important corollary of this result is an interpolation theorem.
Externí odkaz:
http://arxiv.org/abs/2208.08708