### Envíos recientes

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

(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 ...
• #### A formalization of membrane systems with dynamically evolving structures ﻿ [Artículo]

(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 ...
• #### A Note on Complexity Measures for Probabilistic P Systems ﻿ [Artículo]

(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. ...
• #### A geometric protocol for cryptography with cards ﻿ [Artículo]

(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 ...
• #### Semantics for incident identification and resolution reports ﻿ [Artículo]

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 ...
• #### Some Results on LΔ n+1 ﻿ [Artículo]

(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.
• #### Predicativity through Transfinite Reflection ﻿ [Artículo]

(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 ...
• #### On the quantifier complexity of Δ n+1 (T)– induction ﻿ [Artículo]

(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 ...
• #### On axiom schemes for T-provably Δ1 formulas ﻿ [Artículo]

(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 ...
• #### Local induction and provably total computable functions ﻿ [Artículo]

(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 ...
• #### Induction, minimization and collection for Δ n+1 (T)–formulas ﻿ [Artículo]

(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. ...
• #### Fragments of Arithmetic and true sentences ﻿ [Artículo]

(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 ...
• #### Existentially Closed Models and Conservation Results in Bounded Arithmetic ﻿ [Artículo]

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 ...
• #### Existentially Closed Models in the Framework of Arithmetic ﻿ [Artículo]

(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 ...
• #### Envelopes, indicators and conservativeness ﻿ [Artículo]

(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 ...
• #### A note on parameter free Π1-induction and restricted exponentiation ﻿ [Artículo]

(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 ...
• #### Towards Maude 2.0 ﻿ [Artículo]

(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 ...
• #### Proyecto europeo Siridus ﻿ [Artículo]

(Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
• #### Proyecto europeo D'Homme ﻿ [Artículo]

(Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
• #### Parsing bidimensional de estructuras DAG mediante el algoritmo SCP y su aplicación al reconocimiento de habla ﻿ [Artículo]

(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. ...