Santiago Figueira

According to our database1, Santiago Figueira authored at least 49 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rauzy dimension and finite-state dimension.
CoRR, 2024

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

PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2021
A theory of memory for binary sequences: Evidence for a mental compression algorithm in humans.
PLoS Comput. Biol., 2021

2020
Finite Controllability for Ontology-Mediated Query Answering of CRPQ.
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.
NeuroImage, 2019

Closure Properties of Synchronized Relations.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Algorithmic identification of probabilities is hard.
J. Comput. Syst. Sci., 2018

Bisimulations on Data Graphs.
J. Artif. Intell. Res., 2018

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

2017
The language of geometry: Fast comprehension of geometrical primitives and rules in human adults and preschoolers.
PLoS Comput. Biol., 2017

Axiomatizations for downward XPath on data trees.
J. Comput. Syst. Sci., 2017

Model theory of XPath on data trees. Part II: Binary bisimulation and definability.
Inf. Comput., 2017

Logics of Repeating Values on Data Trees and Branching Counter Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2015
Linearizing well quasi-orders and bounding the length of bad sequences.
Theor. Comput. Sci., 2015

Feasible Analysis, Randomness, and Base Invariance.
Theory Comput. Syst., 2015

Counting the changes of random Δ20 sets.
J. Log. Comput., 2015

Normality in non-integer bases and polynomial time randomness.
J. Comput. Syst. Sci., 2015

Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization.
J. Artif. Intell. Res., 2015

Saturation, Definability, and Separation for XPath on Data Trees.
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.
Theor. Comput. Sci., 2014

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies.
J. Comput. Syst. Sci., 2014

Definability for Downward and Vertical XPath on Data Trees.
Proceedings of the Logic, Language, Information, and Computation, 2014

Basic Model Theory of XPath on Data Trees.
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 ω<sup>2</sup>-well quasi-orderings.
Proceedings of the XL Latin American Computing Conference, 2014

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

2012
Completeness results for memory logics.
Ann. Pure Appl. Log., 2012

Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders.
Proceedings of the Logic, Language, Information and Computation, 2012

2011
The Expressive Power of Memory Logics.
Rev. Symb. Log., 2011

On the Expressive Power of IF-Logic with Classical Negation.
Proceedings of the Logic, Language, Information and Computation, 2011

Basic Model Theory for Memory Logics.
Proceedings of the Logic, Language, Information and Computation, 2011

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Using Logic in the Generation of Referring Expressions.
Proceedings of the Logical Aspects of Computational Linguistics, 2011

2010
On the formal semantics of IF-like logics.
J. Comput. Syst. Sci., 2010

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma
CoRR, 2010

The Question of Expressiveness in the Generation of Referring Expressions
CoRR, 2010

Counting the Changes of Random D<sup>0</sup><sub>2</sub> Sets.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

On the Size of Shortest Modal Descriptions.
Proceedings of the Advances in Modal Logic 8, 2010

2009
Indifferent Sets.
J. Log. Comput., 2009

2008
On the computing power of fuzzy Turing machines.
Fuzzy Sets Syst., 2008

Expressive Power and Decidability for Memory Logics.
Proceedings of the Logic, 2008

2007
Turing's unpublished algorithm for normal numbers.
Theor. Comput. Sci., 2007

2006
Randomness and halting probabilities.
J. Symb. Log., 2006

Randomness and universal machines.
J. Complex., 2006

Classical Computability and Fuzzy Turing Machines.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
Program Size Complexity for Possibly Infinite Computations.
Notre Dame J. Formal Log., 2005

Kolmogorov Complexity for Possibly Infinite Computations.
J. Log. Lang. Inf., 2005

Lowness Properties and Approximations of the Jump.
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

2002
An example of a computable absolutely normal number.
Theor. Comput. Sci., 2002


  Loading...