Buscar
Mostrando ítems 31-40 de 43
Artículo
La situación de las hipotecas en España
(Fundación Emmanuel Mounier, 2011)
Artículo
Global structural stability and the role of cooperation in mutualistic systems
(Public Library of Science (Plos), 2022)
Dynamical systems on graphs allow to describe multiple phenomena from different areas of Science. In particular, many complex systems in Ecology are studied by this approach. In this paper we analize the mathematical ...
Artículo
Tuning the program transformers from LCC to PDL
(IFCoLog (The International Federation for Computational Logic), 2018)
This work proposes an alternative definition of the so-called program transformers used to obtain reduction axioms in the Logic of Communication and Change (LCC). Our proposal uses an elegant matrix treatment of ...
Artículo
Metamodeling abduction
(Universidad del País Vasco, 2007)
Abduction can be intended as a special kind of deductive consequence. In fact a general trend is to consider it as a backward deduction with some additional conditions. However, there can be more than one kind of deduction, ...
Artículo
A colouring protocol for the generalized Russian cards problem
(Elsevier, 2013)
In the generalized Russian cards problem, Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of size a + b + c. Alice and Bob must then communicate their entire hand to each other, without Cath learning ...
Tesis Doctoral
Modelos formales de explicación en Lógica e inteligencia artificial
(2005)
La abducción es el tipo de razonamiento en que, dada una teoría T (habitualmente un conjunto de fórmulas del lenguaje con el que se trabaje) y una observación O (generalmente una fórmula), tales que ni O ni su negación son ...
Artículo
El tú y el yo en la nueva ciencia cognitiva
(Fundación Emmanuel Mounier, 2016)
Ponencia
Cálculo de δ-resolución proposicional
(Sociedad de Lógica, Metodología y Filosofía de la Ciencia en España, 2004)
Artículo
A impulsos de actos creadores
(Fundación Emmanuel Mounier, 2016)
Artículo
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
(IOS Press, 2013)
We show that real-value approximations of Kolmogorov-Chaitin complexity K(s) using the algorithmic coding theorem, as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 ...