default search action
Fernando Soler-Toscano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Fernando Soler-Toscano
, Marcos Bautista López Aznar
An Innovative Approach to Diagrams Representation: The Marlo Diagrams Web Page. Diagrams 2024: 449-453 - 2023
- [j23]Francisco José Esteban, Antonio José Ibañez-Molina, Sergio Iglesias-Parro, Juan Ruiz de Miras
Editorial: Complex network dynamics in consciousness. Frontiers Comput. Neurosci. 17 (2023) - 2022
- [b1]Hector Zenil, Fernando Soler-Toscano
Methods and Applications of Algorithmic Complexity - Beyond Statistical Lossless Compression. Springer 2022, ISBN 978-3-662-64983-1, pp. 3-256 - [j22]Fernando Soler-Toscano
What lies underneath: Precise classification of brain states using time-dependent topological structure of dynamics. PLoS Comput. Biol. 18(9): 1010412 (2022)
2010 – 2019
- 2019
- [j21]Juan Ruiz de Miras
Fractal dimension analysis of states of consciousness and unconsciousness using transcranial magnetic stimulation. Comput. Methods Programs Biomed. 175: 129-137 (2019) - [j20]Piotr Kalita
Informational Structures and Informational Fields as a Prototype for the Description of Postulates of the Integrated Information Theory. Entropy 21(5): 493 (2019) - [i17]Fernando Soler-Toscano:
Which is the least complex explanation? Abduction and complexity. CoRR abs/1902.05479 (2019) - 2018
- [j19]Hector Zenil, Santiago Hernández-Orozco, Narsis Aftab Kiani
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity. Entropy 20(8): 605 (2018) - [j18]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): 71-96 (2018) - [j17]Francisco José Esteban
Informational structures: A dynamical system approach for integrated information. PLoS Comput. Biol. 14(9) (2018) - 2017
- [j16]Fernando Soler-Toscano
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences. Complex. 2017: 7208216:1-7208216:10 (2017) - [j15]Nicolas Gauvrit
Human behavioral complexity peaks at age 25. PLoS Comput. Biol. 13(4) (2017) - 2016
- [i16]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 abs/1609.00110 (2016) - 2015
- [j14]Andrés Cordón-Franco
A geometric protocol for cryptography with cards. Des. Codes Cryptogr. 74(1): 113-125 (2015) - [j13]David Fernández-Duque, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morillo, Fernando Soler-Toscano
Forgetting complex propositions. Log. J. IGPL 23(6): 942-965 (2015) - [j12]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: e23 (2015) - [c8]Ángel Nepomuceno-Fernández, Enrique Sarrión-Morillo, Fernando Soler-Toscano
Public and Secret Forgetting of Propositional Formulas. CAEPIA 2015: 139-149 - [i15]Fernando Soler-Toscano, Hector Zenil:
A Computable Measure of Algorithmic Probability by Finite Approximations. CoRR abs/1504.06240 (2015) - [i14]David Fernández-Duque, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada:
Forgetting complex propositions. CoRR abs/1507.01111 (2015) - [i13]Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil:
Natural scene statistics mediate the perception of image complexity. CoRR abs/1509.03970 (2015) - 2014
- [j11]Fernando Soler-Toscano
Generation and Selection of Abductive Explanations for Non-Omniscient Agents. J. Log. Lang. Inf. 23(2): 141-168 (2014) - [c7]Pere Pardo
Efficient Program Transformers for Translating LCC to PDL. JELIA 2014: 253-266 - [i12]Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano, Hector Zenil:
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method. CoRR abs/1409.4080 (2014) - 2013
- [j10]Fernando Soler-Toscano, Hector Zenil
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. Comput. 2(2): 125-140 (2013) - [j9]Ángel Nepomuceno-Fernández, Fernando Soler-Toscano
An epistemic and dynamic approach to abductive reasoning: selecting the best explanation. Log. J. IGPL 21(6): 943-961 (2013) - [j8]Fernando R. Velázquez-Quesada
An epistemic and dynamic approach to abductive reasoning: Abductive problem and abductive solution. J. Appl. Log. 11(4): 505-522 (2013) - [j7]Andrés Cordón-Franco
A colouring protocol for the generalized Russian cards problem. Theor. Comput. Sci. 495: 81-95 (2013) - [i11]Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Fernando Soler-Toscano:
A geometric protocol for cryptography with cards. CoRR abs/1301.4289 (2013) - [i10]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 abs/1306.0322 (2013) - [i9]Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
Fractal dimension versus computational complexity. CoRR abs/1309.1779 (2013) - 2012
- [j6]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: 163-176 (2012) - [j5]Fernando Soler-Toscano
A modal framework for modelling abductive reasoning. Log. J. IGPL 20(2): 438-444 (2012) - [j4]Hector Zenil
Empirical Encounters with Computational Irreducibility and Unpredictability. Minds Mach. 22(3): 149-165 (2012) - [c6]Ignacio Hernández-Antón, Fernando Soler-Toscano
Unconditionally Secure Protocols with Genetic Algorithms. PAAMS (Special Sessions) 2012: 121-128 - [c5]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: 155-162 - [i8]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 abs/1207.5216 (2012) - [i7]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines. CoRR abs/1211.1302 (2012) - [i6]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. CoRR abs/1211.4891 (2012) - [i5]Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit:
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility. CoRR abs/1212.6745 (2012) - 2011
- [j3]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): 353-387 (2011) - [c4]Hans van Ditmarsch, Fernando Soler-Toscano
Three Steps. CLIMA 2011: 41-57 - [c3]Michael H. Albert, Andrés Cordón-Franco
Secure Communication of Local States in Interpreted Systems. DCAI 2011: 117-124 - [p1]Ángel Nepomuceno-Fernández, Fernando Soler-Toscano, Atocha Aliseda-Llera
Searching for the Unity of Science: From Classical Logic to Abductive Logical Systems. Otto Neurath and the Unity of Science 2011: 201-212 - [e1]Patrick Blackburn, Hans van Ditmarsch, María Manzano, Fernando Soler-Toscano:
Tools for Teaching Logic - Third International Congress, TICTTL 2011, Salamanca, Spain, June 1-4, 2011. Proceedings. Lecture Notes in Computer Science 6680, Springer 2011, ISBN 978-3-642-21349-6 [contents] - [i4]Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines. CoRR abs/1102.5389 (2011) - [i3]Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten:
Empirical Encounters with Computational Irreducibility and Unpredictability. CoRR abs/1104.3421 (2011) - [i2]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 abs/1111.0156 (2011) - 2010
- [c2]Fernando Soler-Toscano, Fernando R. Velázquez-Quesada:
Abduction for (Non-Omniscient) Agents. MALLOW 2010 - [i1]Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
Complejidad descriptiva y computacional en máquinas de Turing pequeñas. CoRR abs/1010.1328 (2010)
2000 – 2009
- 2009
- [j2]Ángel Nepomuceno-Fernández, Fernando Soler-Toscano
Abduction via C-tableaux and delta-resolution. J. Appl. Non Class. Logics 19(2): 211-225 (2009) - 2006
- [j1]Fernando Soler-Toscano
Model-Baded Abduction via Dual Resolution. Log. J. IGPL 14(2): 305-319 (2006) - [c1]Fernando Soler-Toscano
: Tableaux and Resolution for Finite Abduction. JELIA 2006: 511-514
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: