Santiago Figueira

Olivier Carton

CoRR, 2024

2023

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

[BibT_eX]

[DOI]

Gabriel Goren Roig

CoRR, 2023

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

[BibT_eX]

[DOI]

Edwin Pin Baque

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.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2021

2020

Finite Controllability for Ontology-Mediated Query Answering of CRPQ.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

NeuroImage, 2019

Closure Properties of Synchronized Relations.

[BibT_eX]

[DOI]

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

2018

Algorithmic identification of probabilities is hard.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Bisimulations on Data Graphs.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

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

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2017

Axiomatizations for downward XPath on data trees.

[BibT_eX]

[DOI]

Raul Fervari

J. Comput. Syst. Sci., 2017

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

[BibT_eX]

[DOI]

Inf. Comput., 2017

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

[BibT_eX]

[DOI]

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

2015

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

[BibT_eX]

[DOI]

Gabriel Senno

Theor. Comput. Sci., 2015

Feasible Analysis, Randomness, and Base Invariance.

[BibT_eX]

[DOI]

André Nies

Theory Comput. Syst., 2015

Counting the changes of random Δ20 sets.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

Normality in non-integer bases and polynomial time randomness.

[BibT_eX]

[DOI]

Javier Ignacio Almarza

J. Comput. Syst. Sci., 2015

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

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Facundo Carreiro

Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

Rafael Grimson

J. Comput. Syst. Sci., 2014

Definability for Downward and Vertical XPath on Data Trees.

[BibT_eX]

[DOI]

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

Basic Model Theory of XPath on Data Trees.

[BibT_eX]

[DOI]

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 ω2-well quasi-orderings.

[BibT_eX]

[DOI]

Proceedings of the XL Latin American Computing Conference, 2014

2013

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

[BibT_eX]

[DOI]

Sergio Romano

Mariano Sigman

CoRR, 2013

2012

Completeness results for memory logics.

[BibT_eX]

[DOI]

Sergio Mera

Ann. Pure Appl. Log., 2012

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

[BibT_eX]

[DOI]

Gabriel Senno

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

2011

The Expressive Power of Memory Logics.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2011

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

[BibT_eX]

[DOI]

Rafael Grimson

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

Basic Model Theory for Memory Logics.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Using Logic in the Generation of Referring Expressions.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2011

2010

On the formal semantics of IF-like logics.

[BibT_eX]

[DOI]

Rafael Grimson

J. Comput. Syst. Sci., 2010

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma

[BibT_eX]

[DOI]

CoRR, 2010

The Question of Expressiveness in the Generation of Referring Expressions

[BibT_eX]

[DOI]

CoRR, 2010

Counting the Changes of Random D02 Sets.

[BibT_eX]

[DOI]

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

On the Size of Shortest Modal Descriptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 8, 2010

2009

Indifferent Sets.

[BibT_eX]

[DOI]

Benjamín René Callejas Bedregal

Joseph S. Miller

André Nies

J. Log. Comput., 2009

2008

On the computing power of fuzzy Turing machines.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2008

Expressive Power and Decidability for Memory Logics.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2008

2007

Turing's unpublished algorithm for normal numbers.

[BibT_eX]

[DOI]

Rafael Picchi

Theor. Comput. Sci., 2007

2006

Randomness and halting probabilities.

[BibT_eX]

[DOI]

J. Symb. Log., 2006

Randomness and universal machines.

[BibT_eX]

[DOI]

Benjamín René Callejas Bedregal

Frank Stephan

Guohua Wu

J. Complex., 2006

Classical Computability and Fuzzy Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Program Size Complexity for Possibly Infinite Computations.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2005

Kolmogorov Complexity for Possibly Infinite Computations.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2005

Lowness Properties and Approximations of the Jump.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]