Santiago Figueira

According to our database, Santiago Figueira authored at least 48 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A Modal Logic with n-ary Relations Over Paths: Comonadic Semantics and Expressivity.

Santiago Figueira, Gabriel Goren Roig

CoRR, 2023

PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse.

Diego Figueira, Santiago Figueira, Edwin Pin Baque

LICS, 2023

2021

A theory of memory for binary sequences: Evidence for a mental compression algorithm in humans.

Samuel Planton, Timo van Kerkoerle, Leïla Abbih, Maxime Maheu, Florent Meyniel, Mariano Sigman, Liping Wang, Santiago Figueira, Sergio Romano, Stanislas Dehaene

PLoS Comput. Biol., 2021

2020

Finite Controllability for Ontology-Mediated Query Answering of CRPQ.

Diego Figueira, Santiago Figueira, Edwin Pin Baque

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019

Representation of spatial sequences using nested rules in human prefrontal cortex.

Liping Wang, Marie Amalric, Wen Fang, Xinjian Jiang, Christophe Pallier, Santiago Figueira, Mariano Sigman, Stanislas Dehaene

NeuroImage, 2019

Closure Properties of Synchronized Relations.

María Emilia Descotte, Diego Figueira, Santiago Figueira

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Algorithmic identification of probabilities is hard.

Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen

J. Comput. Syst. Sci., 2018

Bisimulations on Data Graphs.

Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira

J. Artif. Intell. Res., 2018

Learning is Compiling: Experience Shapes Concept Learning by Combining Primitives in a Language of Thought.

Pablo Tano, Sergio Romano, Mariano Sigman, Alejo Salles, Santiago Figueira

CoRR, 2018

2017

The language of geometry: Fast comprehension of geometrical primitives and rules in human adults and preschoolers.

Marie Amalric, Liping Wang, Pierre Pica, Santiago Figueira, Mariano Sigman, Stanislas Dehaene

PLoS Comput. Biol., 2017

Axiomatizations for downward XPath on data trees.

Sergio Abriola, María Emilia Descotte, Raul Fervari, Santiago Figueira

J. Comput. Syst. Sci., 2017

Model theory of XPath on data trees. Part II: Binary bisimulation and definability.

Sergio Abriola, María Emilia Descotte, Santiago Figueira

Inf. Comput., 2017

Logics of Repeating Values on Data Trees and Branching Counter Systems.

Sergio Abriola, Diego Figueira, Santiago Figueira

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2015

Linearizing well quasi-orders and bounding the length of bad sequences.

Sergio Abriola, Santiago Figueira, Gabriel Senno

Theor. Comput. Sci., 2015

Feasible Analysis, Randomness, and Base Invariance.

Santiago Figueira, André Nies

Theory Comput. Syst., 2015

Counting the changes of random Δ20 sets.

Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies

J. Log. Comput., 2015

Normality in non-integer bases and polynomial time randomness.

Javier Ignacio Almarza, Santiago Figueira

J. Comput. Syst. Sci., 2015

Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization.

Diego Figueira, Santiago Figueira, Carlos Areces

J. Artif. Intell. Res., 2015

Saturation, Definability, and Separation for XPath on Data Trees.

Sergio Abriola, María Emilia Descotte, Santiago Figueira

Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

2014

Characterization, definability and separation via saturated models.

Carlos Areces, Facundo Carreiro, Santiago Figueira

Theor. Comput. Sci., 2014

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies.

Santiago Figueira, Daniel Gorín, Rafael Grimson

J. Comput. Syst. Sci., 2014

Definability for Downward and Vertical XPath on Data Trees.

Sergio Abriola, María Emilia Descotte, Santiago Figueira

Proceedings of the Logic, Language, Information, and Computation, 2014

Basic Model Theory of XPath on Data Trees.

Diego Figueira, Santiago Figueira, Carlos Areces

Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

A note on the order type of minoring orderings and some algebraic properties of ω²-well quasi-orderings.

Sergio Abriola, Santiago Figueira

Proceedings of the XL Latin American Computing Conference, 2014

2013

LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity

Sergio Romano, Mariano Sigman, Santiago Figueira

CoRR, 2013

2012

Completeness results for memory logics.

Carlos Areces, Santiago Figueira, Sergio Mera

Ann. Pure Appl. Log., 2012

Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders.

Sergio Abriola, Santiago Figueira, Gabriel Senno

Proceedings of the Logic, Language, Information and Computation, 2012

2011

The Expressive Power of Memory Logics.

Carlos Areces, Diego Figueira, Santiago Figueira, Sergio Mera

Rev. Symb. Log., 2011

On the Expressive Power of IF-Logic with Classical Negation.

Santiago Figueira, Daniel Gorín, Rafael Grimson

Proceedings of the Logic, Language, Information and Computation, 2011

Basic Model Theory for Memory Logics.

Carlos Areces, Facundo Carreiro, Santiago Figueira, Sergio Mera

Proceedings of the Logic, Language, Information and Computation, 2011

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Using Logic in the Generation of Referring Expressions.

Carlos Areces, Santiago Figueira, Daniel Gorín

Proceedings of the Logical Aspects of Computational Linguistics, 2011

2010

On the formal semantics of IF-like logics.

Santiago Figueira, Daniel Gorín, Rafael Grimson

J. Comput. Syst. Sci., 2010

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen

CoRR, 2010

The Question of Expressiveness in the Generation of Referring Expressions

Carlos Areces, Santiago Figueira, Daniel Gorín

CoRR, 2010

Counting the Changes of Random D⁰₂ Sets.

Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

On the Size of Shortest Modal Descriptions.

Santiago Figueira, Daniel Gorín

Proceedings of the Advances in Modal Logic 8, 2010

2009

Indifferent Sets.

Santiago Figueira, Joseph S. Miller, André Nies

J. Log. Comput., 2009

2008

On the computing power of fuzzy Turing machines.

Benjamín René Callejas Bedregal, Santiago Figueira

Fuzzy Sets Syst., 2008

Expressive Power and Decidability for Memory Logics.

Carlos Areces, Diego Figueira, Santiago Figueira, Sergio Mera

Proceedings of the Logic, 2008

2007

Turing's unpublished algorithm for normal numbers.

Verónica Becher, Santiago Figueira, Rafael Picchi

Theor. Comput. Sci., 2007

2006

Randomness and halting probabilities.

Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller

J. Symb. Log., 2006

Randomness and universal machines.

Santiago Figueira, Frank Stephan, Guohua Wu

J. Complex., 2006

Classical Computability and Fuzzy Turing Machines.

Benjamín René Callejas Bedregal, Santiago Figueira

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Program Size Complexity for Possibly Infinite Computations.

Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi

Notre Dame J. Formal Log., 2005

Kolmogorov Complexity for Possibly Infinite Computations.

Verónica Becher, Santiago Figueira

J. Log. Lang. Inf., 2005

Lowness Properties and Approximations of the Jump.

Santiago Figueira, André Nies, Frank Stephan

Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

2002

An example of a computable absolutely normal number.

Verónica Becher, Santiago Figueira

Theor. Comput. Sci., 2002