Reports de recerca
Recent Submissions
-
Dos aproximaciones a la adquisición del conocimiento léxico y conceptual para sistemas de procesamiento del lenguaje natural
(1991-11-06)
External research report
Open AccessProcessament del llenguatge natural -
The design of a parallel algorithm to solve the word problem for the free partially commutative groups
(1991-10-15)
External research report
Open AccessWe 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
(1991-09-30)
External research report
Open AccessPresentamos 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
(1991-09-30)
External research report
Open AccessThe 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
(1991-10-15)
External research report
Open AccessWe 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
(1991-10-15)
External research report
Open AccessWe 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?
(1991-10)
External research report
Open Access -
Bounded queries to arbitrary sets
(1991-09)
External research report
Open AccessWe 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
(1991-02-20)
External research report
Open AccessIn 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
(1991-03)
External research report
Open AccessIn 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
(1991-03)
External research report
Open AccessThe 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
(1991-05)
External research report
Open AccessThe 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 ...
RSS 1.0