Envíos recientes

  • IconAn extension of GHMMs for environments with occlusions and automatic goal discovery for person trajectory prediction  [Ponencia]

    Pérez Hurtado de Mendoza, Ignacio; Capitán, Jesús; Caballero, Fernando; Merino, Luis (IEEE Computer Society, 2015)
    Robots navigating in a social way should use some knowledge about common motion patterns of people in the environment. Moreover, it is known that people move intending to reach certain points of interest, and machine ...
  • IconA formalization of membrane systems with dynamically evolving structures  [Artículo]

    Freund, Rudolf; Pérez Hurtado de Mendoza, Ignacio; Riscos Núñez, Agustín; Verlan, Sergey (Taylor and Francis, 2013)
    This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition ...
  • IconA Note on Complexity Measures for Probabilistic P Systems  [Artículo]

    Cordón Franco, Andrés; Sancho Caparrini, Fernando (J.UCS.org, 2004)
    In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in order to obtain some quantitative parameters showing how complex the evolution of a P system is. ...
  • IconA geometric protocol for cryptography with cards  [Artículo]

    Cordón Franco, Andrés; Ditmarsch, Hans P. van; Fernández Duque, David; Soler Toscano, Fernando (Springer, 2015)
    In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of a + b + c cards. Players only know their own cards and what the deck of cards is. Alice ...
  • IconSemantics for incident identification and resolution reports  [Artículo]

    Borrego Díaz, Joaquín; Chávez González, Antonia María; Pro Martín, José Luis; Matos Arana, Virginia (Oxford Academic, 2016)
    In order to achieve a safe and systematic treatment of security protocols, organizations release a number of technical briefings describing how to detect and manage security incidents. A critical issue is that this document ...
  • IconSome Results on LΔ n+1  [Artículo]

    Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Wiley, 2001)
    We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas.
  • IconPredicativity through Transfinite Reflection  [Artículo]

    Cordón Franco, Andrés; Fernández Duque, David; Joosten, Joost J.; Lara Martín, Francisco Félix (The Association for Symbolic Logic, 2017)
    Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use as a formalization of “φ is provable from T and an oracle for the set X, using ω-rules of nesting depth at most λ”. For a set of ...
  • IconOn the quantifier complexity of Δ n+1 (T)– induction  [Artículo]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2004)
    In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class ...
  • IconOn axiom schemes for T-provably Δ1 formulas  [Artículo]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2014)
    This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and least number axiom schemes to formulas which are Δ1 provably in an arithmetic theory T. In ...
  • IconLocal induction and provably total computable functions  [Artículo]

    Cordón Franco, Andrés; Lara Martín, Francisco Félix (Elsevier, 2014)
    Let I¦− 2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to parameter free ¦2 formulas. Answering a question of R. Kaye, L. Beklemishev showed that the provably total computable ...
  • IconInduction, minimization and collection for Δ n+1 (T)–formulas  [Artículo]

    Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2004)
    For a theory T, we study relationships among IΔ n +1 (T), LΔ n+1 (T) and B * Δ n+1 (T). These theories are obtained restricting the schemes of induction, minimization and (a version of) collection to Δ n+1 (T) formulas. ...
  • IconFragments of Arithmetic and true sentences  [Artículo]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Wiley, 2005)
    By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is the only (up to deductive equivalence) consistent ¦n+1–theory which extends the scheme of induction ...
  • IconExistentially Closed Models and Conservation Results in Bounded Arithmetic  [Artículo]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Oxford Academic, 2009)
    We develop model-theoretic techniques to obtain conservation results for first order Bounded Arithmetic theories, based on a hierarchical version of the well-known notion of an existentially closed model. We focus on the ...
  • IconExistentially Closed Models in the Framework of Arithmetic  [Artículo]

    Adamowicz, Zofia; Cordón Franco, Andrés; Lara Martín, Francisco Félix (The Association for Symbolic Logic, 2016)
    We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (parameter free) П1–formula. This definition is optimal with respect to quantifier complexity and allows us to improve some ...
  • IconEnvelopes, indicators and conservativeness  [Artículo]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Wiley, 2006)
    A well known theorem proved (independently) by J. Paris and H. Friedman states that BΣn +1 (the fragment of Arithmetic given by the collection scheme restricted to Σn +1‐formulas) is a Πn +2‐conservative extension of IΣn ...
  • IconA note on parameter free Π1-induction and restricted exponentiation  [Artículo]

    Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Wiley, 2011)
    We characterize the sets of all Π2 and all $\mathcal {B}(\Sigma _{1})$equation image (= Boolean combinations of Σ1) theorems of IΠ−1 in terms of restricted exponentiation, and use these characterizations to prove that both ...
  • IconTowards Maude 2.0  [Artículo]

    Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí Oliet, N.; Meseguer, J.; Quesada Moreno, José Francisco (Elsevier, 2000)
    Maude 2.0 is the new version of the Maude rewriting logic language currently under development. Maude 2.0’s three main goals are: (i) greater generality and expressiveness;( ii) efficient support for a wider range of ...
  • IconProyecto europeo Siridus  [Artículo]

    Quesada Moreno, José Francisco; Amores Carredano, José Gabriel De (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
  • IconProyecto europeo D'Homme  [Artículo]

    Quesada Moreno, José Francisco; Amores Carredano, José Gabriel De (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
  • IconParsing bidimensional de estructuras DAG mediante el algoritmo SCP y su aplicación al reconocimiento de habla  [Artículo]

    Quesada Moreno, José Francisco (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2002)
    Este trabajo presenta una estrategia para la integración de los módulos de reconocimiento de habla, parsing basado en unificación y gestión de diálogo que permita la mejora de los sistemas de gestión de diálogo hablado. ...

Ver más