Santiago Figueira

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 23

Top Topics

Closure Properties

Prefrontal Cortex

Compression Algorithm

Top Venues

J. Comput. Syst. Sci.

J. Artif. Intell. Res.

Theor. Comput. Sci.

Publications

Verónica Becher, Olivier Carton, Santiago Figueira
Rauzy dimension and finite-state dimension. CoRR (2024)
Diego Figueira, Santiago Figueira, Edwin Pin Baque
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse. CoRR (2023)
Diego Figueira, Santiago Figueira, Edwin Pin Baque
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse. LICS (2023)
Santiago Figueira, Gabriel Goren Roig
A Modal Logic with n-ary Relations Over Paths: Comonadic Semantics and Expressivity. CoRR (2023)
Samuel Planton, Timo van Kerkoerle, Leïla Abbih, Maxime Maheu, Florent Meyniel, Mariano Sigman, Liping Wang, Santiago Figueira, Sergio Romano, Stanislas Dehaene
A theory of memory for binary sequences: Evidence for a mental compression algorithm in humans. PLoS Comput. Biol. 17 (1) (2021)
Diego Figueira, Santiago Figueira, Edwin Pin Baque
Finite Controllability for Ontology-Mediated Query Answering of CRPQ. KR (2020)
Liping Wang, Marie Amalric, Wen Fang, Xinjian Jiang, Christophe Pallier, Santiago Figueira, Mariano Sigman, Stanislas Dehaene
Representation of spatial sequences using nested rules in human prefrontal cortex. NeuroImage 186 (2019)
María Emilia Descotte, Diego Figueira, Santiago Figueira
Closure Properties of Synchronized Relations. STACS (2019)
Pablo Tano, Sergio Romano, Mariano Sigman, Alejo Salles, Santiago Figueira
Learning is Compiling: Experience Shapes Concept Learning by Combining Primitives in a Language of Thought. CoRR (2018)
Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen
Algorithmic identification of probabilities is hard. J. Comput. Syst. Sci. 95 (2018)
Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira
Bisimulations on Data Graphs. J. Artif. Intell. Res. 61 (2018)
Sergio Abriola, María Emilia Descotte, Raul Fervari, Santiago Figueira
Axiomatizations for downward XPath on data trees. J. Comput. Syst. Sci. 89 (2017)
Sergio Abriola, María Emilia Descotte, Santiago Figueira
Model theory of XPath on data trees. Part II: Binary bisimulation and definability. Inf. Comput. 255 (2017)
Marie Amalric, Liping Wang, Pierre Pica, Santiago Figueira, Mariano Sigman, Stanislas Dehaene
The language of geometry: Fast comprehension of geometrical primitives and rules in human adults and preschoolers. PLoS Comput. Biol. 13 (1) (2017)
Sergio Abriola, Diego Figueira, Santiago Figueira
Logics of Repeating Values on Data Trees and Branching Counter Systems. FoSSaCS (2017)
Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira
Bisimulations on Data Graphs. KR (2016)
Sergio Abriola, María Emilia Descotte, Raul Fervari, Santiago Figueira
Axiomatizations for downward XPath on Data Trees. CoRR (2016)
Santiago Figueira, André Nies
Feasible Analysis, Randomness, and Base Invariance. Theory Comput. Syst. 56 (3) (2015)
Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies
Counting the changes of random Δ20 sets. J. Log. Comput. 25 (4) (2015)
Sergio Abriola, María Emilia Descotte, Santiago Figueira
Saturation, Definability, and Separation for XPath on Data Trees. AMW (2015)
Javier Ignacio Almarza, Santiago Figueira
Normality in non-integer bases and polynomial time randomness. J. Comput. Syst. Sci. 81 (7) (2015)
Sergio Abriola, Santiago Figueira, Gabriel Senno
Linearizing well quasi-orders and bounding the length of bad sequences. Theor. Comput. Sci. 603 (2015)
Diego Figueira, Santiago Figueira, Carlos Areces
Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization. J. Artif. Intell. Res. 53 (2015)
Javier Ignacio Almarza, Santiago Figueira
Normality in non-integer bases and polynomial time randomness. CoRR (2014)
Sergio Abriola, María Emilia Descotte, Santiago Figueira
Definability for Downward and Vertical XPath on Data Trees. WoLLIC (2014)
Santiago Figueira, Daniel Gorín, Rafael Grimson
Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies. J. Comput. Syst. Sci. 80 (6) (2014)
Sergio Abriola, Santiago Figueira
-well quasi-orderings. CLEI (2014)
Diego Figueira, Santiago Figueira, Carlos Areces
Basic Model Theory of XPath on Data Trees. ICDT (2014)
Carlos Areces, Facundo Carreiro, Santiago Figueira
Characterization, definability and separation via saturated models. Theor. Comput. Sci. 537 (2014)
Sergio Romano, Mariano Sigman, Santiago Figueira
LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity CoRR (2013)
Carlos Areces, Santiago Figueira, Sergio Mera
Completeness results for memory logics. Ann. Pure Appl. Log. 163 (7) (2012)
Sergio Abriola, Santiago Figueira, Gabriel Senno
Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders. WoLLIC (2012)
Carlos Areces, Facundo Carreiro, Santiago Figueira, Sergio Mera
Basic Model Theory for Memory Logics. WoLLIC (2011)
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS (2011)
Santiago Figueira, Daniel Gorín, Rafael Grimson
On the Expressive Power of IF-Logic with Classical Negation. WoLLIC (2011)
Carlos Areces, Santiago Figueira, Daniel Gorín
Using Logic in the Generation of Referring Expressions. LACL (2011)
Carlos Areces, Diego Figueira, Santiago Figueira, Sergio Mera
The Expressive Power of Memory Logics. Rev. Symb. Log. 4 (2) (2011)
Santiago Figueira, Daniel Gorín, Rafael Grimson
On the formal semantics of IF-like logics. J. Comput. Syst. Sci. 76 (5) (2010)
Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies
Sets. CiE (2010)
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma CoRR (2010)
Carlos Areces, Santiago Figueira, Daniel Gorín
The Question of Expressiveness in the Generation of Referring Expressions CoRR (2010)
Santiago Figueira, Daniel Gorín
On the Size of Shortest Modal Descriptions. Advances in Modal Logic (2010)
Santiago Figueira, Joseph S. Miller, André Nies
Indifferent Sets. J. Log. Comput. 19 (2) (2009)
Carlos Areces, Santiago Figueira, Sergio Mera
Completeness Results for Memory Logics. LFCS (2009)
Santiago Figueira, André Nies, Frank Stephan
Lowness properties and approximations of the jump. Ann. Pure Appl. Log. 152 (1-3) (2008)
Benjamín René Callejas Bedregal, Santiago Figueira
On the computing power of fuzzy Turing machines. Fuzzy Sets Syst. 159 (9) (2008)
Santiago Figueira, Daniel Gorín, Rafael Grimson
On the Formal Semantics of IF-Like Logics. WoLLIC (2008)
Carlos Areces, Diego Figueira, Santiago Figueira, Sergio Mera
Expressive Power and Decidability for Memory Logics. WoLLIC (2008)
Verónica Becher, Santiago Figueira, Rafael Picchi
Turing's unpublished algorithm for normal numbers. Theor. Comput. Sci. 377 (1-3) (2007)
Benjamín René Callejas Bedregal, Santiago Figueira
Classical Computability and Fuzzy Turing Machines. LATIN (2006)
Santiago Figueira, Frank Stephan, Guohua Wu
Randomness and universal machines. J. Complex. 22 (6) (2006)
Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller
Randomness and halting probabilities. J. Symb. Log. 71 (4) (2006)
Santiago Figueira, André Nies, Frank Stephan
Lowness Properties and Approximations of the Jump. Electron. Notes Theor. Comput. Sci. 143 (2006)
Santiago Figueira, Frank Stephan, Guohua Wu
Randomness and Universal Machines. CCA (2005)
Verónica Becher, Santiago Figueira
Kolmogorov Complexity for Possibly Infinite Computations. J. Log. Lang. Inf. 14 (2) (2005)
Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi
Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46 (1) (2005)
Verónica Becher, Santiago Figueira
An example of a computable absolutely normal number. Theor. Comput. Sci. 270 (1-2) (2002)