Fernando Soler-Toscano

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 11

Top Topics

Shannon Entropy

Propositional Formulas

Information Theory

Probability Measures

Top Venues

PLoS Comput. Biol.

Des. Codes Cryptogr.

Publications

Francisco José Esteban, Antonio José Ibañez-Molina, Sergio Iglesias-Parro, Juan Ruiz de Miras, Fernando Soler-Toscano
Editorial: Complex network dynamics in consciousness. Frontiers Comput. Neurosci. 17 (2023)
Fernando Soler-Toscano, Javier A. Galadí, Anira Escrichs, Yonatan Sanz Perl, Ane López-González, Jacobo D. Sitt, Jitka Annen, Olivia Gosseries, Aurore Thibaut, Rajanikant Panda, Francisco José Esteban, Steven Laureys, Morten L. Kringelbach, José A. Langa, Gustavo Deco
What lies underneath: Precise classification of brain states using time-dependent topological structure of dynamics. PLoS Comput. Biol. 18 (9) (2022)
Fernando Soler-Toscano
Which is the least complex explanation? Abduction and complexity. CoRR (2019)
Juan Ruiz de Miras, Fernando Soler-Toscano, Sergio Iglesias-Parro, Antonio José Ibañez-Molina, Adenauer G. Casali, Steven Laureys, Marcello Massimini, Francisco José Esteban, Juan Navas, José A. Langa
Fractal dimension analysis of states of consciousness and unconsciousness using transcranial magnetic stimulation. Comput. Methods Programs Biomed. 175 (2019)
Piotr Kalita, José A. Langa, Fernando Soler-Toscano
Informational Structures and Informational Fields as a Prototype for the Description of Postulates of the Integrated Information Theory. Entropy 21 (5) (2019)
Pere Pardo, Enrique Sarión-Morrillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
Tuning the Program Transformers from CC to PDL. FLAP 5 (1) (2018)
Hector Zenil, Santiago Hernández-Orozco, Narsis Aftab Kiani, Fernando Soler-Toscano, Antonio Rueda-Toicen, Jesper Tegnér
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity. Entropy 20 (8) (2018)
Francisco José Esteban, Javier A. Galadí, José A. Langa, José Ramón Portillo, Fernando Soler-Toscano
Informational structures: A dynamical system approach for integrated information. PLoS Comput. Biol. 14 (9) (2018)
Nicolas Gauvrit, Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Peter Brugger
Human behavioral complexity peaks at age 25. PLoS Comput. Biol. 13 (4) (2017)
Fernando Soler-Toscano, Hector Zenil
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences. Complex. 2017 (2017)
Hector Zenil, Fernando Soler-Toscano, Narsis Aftab Kiani, Santiago Hernández-Orozco, Antonio Rueda-Toicen
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity. CoRR (2016)
David Fernández-Duque, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
Forgetting complex propositions. CoRR (2015)
Ángel Nepomuceno-Fernández, Enrique Sarrión-Morillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
Public and Secret Forgetting of Propositional Formulas. CAEPIA (2015)
Fernando Soler-Toscano, Hector Zenil
A Computable Measure of Algorithmic Probability by Finite Approximations. CoRR (2015)
Héctor Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. PeerJ Comput. Sci. 1 (2015)
Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil
Natural scene statistics mediate the perception of image complexity. CoRR (2015)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Fernando Soler-Toscano
A geometric protocol for cryptography with cards. Des. Codes Cryptogr. 74 (1) (2015)
David Fernández-Duque, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
Forgetting complex propositions. Log. J. IGPL 23 (6) (2015)
Pere Pardo, Enrique Sarrión-Morillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
Efficient Program Transformers for Translating LCC to PDL. JELIA (2014)
Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
Generation and Selection of Abductive Explanations for Non-Omniscient Agents. J. Log. Lang. Inf. 23 (2) (2014)
Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano, Hector Zenil
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method. CoRR (2014)
Hector Zenil, Fernando Soler-Toscano, Kamaludin Dingle, Ard A. Louis
Graph Automorphism and Topological Characterization of Synthetic and Natural Complex Networks by Information Content. CoRR (2013)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Fernando Soler-Toscano
A geometric protocol for cryptography with cards CoRR (2013)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Fernando Soler-Toscano
A colouring protocol for the generalized Russian cards problem. Theor. Comput. Sci. 495 (2013)
Fernando R. Velázquez-Quesada, Fernando Soler-Toscano, Ángel Nepomuceno-Fernández
An epistemic and dynamic approach to abductive reasoning: Abductive problem and abductive solution. J. Appl. Log. 11 (4) (2013)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Fractal dimension versus computational complexity. CoRR (2013)
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. Comput. 2 (2) (2013)
Ángel Nepomuceno-Fernández, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
An epistemic and dynamic approach to abductive reasoning: selecting the best explanation. Log. J. IGPL 21 (6) (2013)
Ignacio Hernández-Antón, Fernando Soler-Toscano, Hans van Ditmarsch
Unconditionally Secure Protocols with Genetic Algorithms. PAAMS (Special Sessions) (2012)
Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten
Empirical Encounters with Computational Irreducibility and Unpredictability. Minds Mach. 22 (3) (2012)
Fernando Soler-Toscano, David Fernández-Duque, Ángel Nepomuceno-Fernández
A modal framework for modelling abductive reasoning. Log. J. IGPL 20 (2) (2012)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano
A secure additive protocol for card players. Australas. J Comb. 54 (2012)
Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility CoRR (2012)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Fernando Soler-Toscano
A colouring protocol for the generalized Russian cards problem CoRR (2012)
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures CoRR (2012)
Hans van Ditmarsch, Jan van Eijck, Ignacio Hernández-Antón, Floor Sietsma, Sunil Simon, Fernando Soler-Toscano
Modelling Cryptographic Keys in Dynamic Epistemic Logic with DEMO. PAAMS (Special Sessions) (2012)
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines CoRR (2012)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines CoRR (2011)
Michael H. Albert, Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano
Secure Communication of Local States in Interpreted Systems. DCAI (2011)
Hans van Ditmarsch, Fernando Soler-Toscano
Three Steps. CLIMA (2011)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines. Int. J. Unconv. Comput. 7 (5) (2011)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano
A secure additive protocol for card players CoRR (2011)
Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten
Empirical Encounters with Computational Irreducibility and Unpredictability CoRR (2011)
Fernando Soler-Toscano, Fernando R. Velázquez-Quesada
Abduction for (Non-Omniscient) Agents. MALLOW (2010)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Complejidad descriptiva y computacional en máquinas de Turing pequeñas CoRR (2010)
Ángel Nepomuceno-Fernández, Fernando Soler-Toscano, Atocha Aliseda-Llera
-tableaux and delta-resolution. J. Appl. Non Class. Logics 19 (2) (2009)
Fernando Soler-Toscano, Ángel Nepomuceno-Fernández
: Tableaux and Resolution for Finite Abduction. JELIA (2006)
Fernando Soler-Toscano, Ángel Nepomuceno-Fernández, Atocha Aliseda-Llera
Model-Baded Abduction via Dual Resolution. Log. J. IGPL 14 (2) (2006)