Recent Submissions

  • Dos aproximaciones a la adquisición del conocimiento léxico y conceptual para sistemas de procesamiento del lenguaje natural 

    Ageno Pulido, Alicia; Castellón Masalles, Irene; Rigau Claramunt, German; Rodríguez Hontoria, Horacio (1991-11-06)
    External research report
    Open Access
    Processament del llenguatge natural
  • The design of a parallel algorithm to solve the word problem for the free partially commutative groups 

    Gabarró Vallès, Joaquim (1991-10-15)
    External research report
    Open Access
    We develop a parallel algorithm to solve the word problem for free partially commutative groups. These groups were introduced by C. Wrathall to generalize free groups. We represent the elements of these groups as a certain ...
  • Un entorno para la extracción de información semántica del diccionario Vox 

    Ageno Pulido, Alicia; Castellón Masalles, Irene; Rigau Claramunt, German; Rodríguez Hontoria, Horacio; Verdejo Maillo, Maria Felisa (1991-09-30)
    External research report
    Open Access
    Presentamos un entorno interactivo para la extracción de información semantica del diccionario Vox. El entorno ha sido diseñado para permitir un alto grado de automatismo en su funcionamiento, así como para proporcionar ...
  • A generalization of the model of permutations for binary search trees 

    Messeguer Peypoch, Xavier (1991-09-30)
    External research report
    Open Access
    The classical model of permutations, that allows the study of consecutive insertions in BST, fails when it considers intermixed deletions and insertions (Knott paradox). Our model solves this paradox by considering the ...
  • First-order completion with ordering constraints: some positive and some negative results 

    Nieuwenhuis, Robert Lukas Mario; Rubio Gimeno, Alberto (1991-10-15)
    External research report
    Open Access
    We show by means of counter examples that some well-known results on the completeness of deduction methods with ordering constraints are incorrect. The problem is caused by the fact that the usual lifting lemmata do not ...
  • Basic superposition is complete 

    Nieuwenhuis, Robert Lukas Mario; Rubio Gimeno, Alberto (1991-10-15)
    External research report
    Open Access
    We define a formalism of equality constraints and use it to prove the completeness of what we have called basic superposition: a restricted form of superposition in which only the subterms not originated in previous ...
  • To be or nought to be: una qüestió irrellevant? 

    Belanche Muñoz, Luis Antonio (1991-10)
    External research report
    Open Access
  • Bounded queries to arbitrary sets 

    Lozano Bojados, Antoni (1991-09)
    External research report
    Open Access
    We prove that if P superA[k] = P superA[k+1] for some k and an arbitrary set A, then A is reducible to its complement under a relativized nondeterministic conjunctive reduction. This result shows the first known property ...
  • Average-case analysis on simple families of trees using a balanced probabilistic model 

    Cases Muñoz, Rafel; Díaz Cort, Josep; Martínez Parra, Conrado (1991-02-20)
    External research report
    Open Access
    In this paper we study a balanced probability model defined over simple families of trees, which from the point of doing statistics on trees, behave in quite a different way from the uniform distribution. Using the new ...
  • Average-case analysis of equality of binary trees under the BST probability model 

    Martínez Parra, Conrado (1991-03)
    External research report
    Open Access
    In this paper a simple algorithm to test equality of binary trees currently used in symbolic computation, unification, etc. is investigated. Surprisingly enough, it takes 0(1) steps on average to decide if a given pair of ...
  • About the attribute relevance's nature 

    Núñez Esquer, Gustavo; Cortés García, Claudio Ulises; Belanche Muñoz, Luis Antonio; Alvarado Mentado, Matías (1991-03)
    External research report
    Open Access
    The notion of relevance of an attribute in machine learning is of common use in the construction of classfication rules in inductive learning processes. In this work a formal definition of the relevance concept for a given ...
  • An approach to correctness of data parallel algorithms 

    Gabarró Vallès, Joaquim; Gavaldà Mestre, Ricard (1991-05)
    External research report
    Open Access
    The design of data parallel algorithms for fine-grained SIMD machines is a fundamental domain in today computer science. High standards in the specification and resolution of problems have been achieved in the sequential ...

View more