107 citations · 174 across the 12 of their papers we have counts for
14 papers
Modal Logic with Relations over Paths: a Theoretical Development through Comonadic Semantics
Santiago Figueira, Gabriel Goren-Roig
Game comonads provide categorical semantics for comparison games in Finite Model Theory, thus providing an abstract characterisation of logical equivalence for a wide range of logi…
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse
Diego Figueira, Santiago Figueira, Edwin Pin
We introduce CPDL+, a family of expressive logics rooted in Propositional Dynamic Logic (PDL). In terms of expressive power, CPDL+ strictly contains PDL extended with intersection…
Characterization of non-signaling correlations from mutual information
Ignacio Perito, Guido Bellomo, Daniel Galicer +3
We present a characterization of the set of non-signaling correlations in terms of a two dimensional representation that involves the maximal value of a Bell functional and the mut…
Impossibility of memory in hidden-signaling models for quantum correlations
Ignacio Perito, Guido Bellomo, Daniel Galicer +3
We consider a toy model for non-local quantum correlations in which nature resorts to some form of hidden signaling (i.e., signaling between boxes but not available to the users) t…
Towards a more flexible Language of Thought: Bayesian grammar updates after each concept exposure
Pablo Tano, Sergio Romano, Mariano Sigman +2
Recent approaches to human concept learning have successfully combined the power of symbolic, infinitely productive rule systems and statistical learning to explain our ability to…
Distinguishing computable mixtures of quantum states
Ignacio H. López Grande, Gabriel Senno, Gonzalo de la Torre +4
In this article we extend results from our previous work [Bendersky, de la Torre, Senno, Figueira and Acín, Phys. Rev. Lett. 116, 230406 (2016)] by providing a protocol to distingu…
Non-signaling deterministic models for non-local correlations have to be uncomputable
Ariel Bendersky, Gabriel Senno, Gonzalo de la Torre +2
Quantum mechanics postulates random outcomes. However, a model making the same output predictions but in a deterministic manner would be, in principle, experimentally indistinguish…
Axiomatizations for downward XPath on Data Trees
Sergio Abriola, María Emilia Descotte, Raul Fervari +1
We give sound and complete axiomatizations for XPath with data tests by "equality" or "inequality", and containing the single "child" axis. This data-aware logic predicts over data…
Normality in non-integer bases and polynomial time randomness
Javier Almarza, Santiago Figueira
It is known that if is polynomial time random (i.e. no polynomial time computable martingale succeeds on the binary fractional expansion of ) then is normal in a…
Algorithmic Pseudorandomness in Quantum Setups
Ariel Bendersky, Gonzalo de la Torre, Gabriel Senno +2
The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. Wh…
Algorithmic identification of probabilities is hard
Laurent Bienvenu, Santiago Figueira, Benoit Monin +1
Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter . By the law of large numbers, the frequency of zeros in the sequence…
LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity
Sergio Romano, Mariano Sigman, Santiago Figueira
In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov…
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
Diego Figueira, Santiago Figueira, Sylvain Schmitz +1
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists…
The Question of Expressiveness in the Generation of Referring Expressions
Carlos Areces, Santiago Figueira, Daniel Gorín
We study the problem of generating referring expressions modulo different notions of expressive power. We define the notion of $\+L$-referring expression, for a formal language $\+…