Browsing Ciencias de la Computación e Inteligencia Artificial by Issue Date
Now showing items 1-20 of 880
-
Presentation
Sobre ciertas expresiones de la función rango, independientes de la teoría de ordinales
(Universitat Autónoma de Barcelona, 1980)In the present work we obtain several representations of the rank func- tion associated to a well founded relation in terms ...
- PhD Thesis
-
PhD Thesis
Bordismo seccional de fibrados y submersiones
(1988-12-16)El objeto de este trabajo es sistematizar una técnica que intenta atacar el problema de existencia de secciones de funciones ...
- Article
-
Presentation
A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
(AEPIA: Asociación Española para la Inteligencia Artificial, 1997)This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which ...
-
Article
Lexical Object Theory: Specification Level
(Springer, 1998)Unification has become a major paradigm in Mathematical and Computational Linguistics. The research done in this area may ...
-
Article
Maude as a Metalanguage
(Elsevier, 1998)One of the key goals of rewriting logic from its beginning has been to provide a semantic and logical framework in which ...
-
Book
Curso Práctico de Teoría de Conjuntos
(Ediciones La Ñ, 1998)Todos los que hemos impartido tópicos diversos relativos a la Teoría de Conjuntos, en primer o segundo ciclo universitario, ...
- Article
-
Presentation
The Maude System
(Springer, 1999) -
PhD Thesis
Estrategias de análisis gramatical y semántico para un sistema dirigido por voz
(1999)El objetivo de esta tesis es demostrar la eficiencia de un módulo del procesamiento de lenguaje natural (PLN) para un ...
- Article
-
Presentation
Interpretación reactiva de sistemas basados en conocimiento.
(Universidad de Granada, 1999) -
Presentation
Multiset Relations: A Tool for Proving Termination
(University of Texas, 2000) -
Presentation
Formalizing Rewriting in the ACL2 Theorem Prover
(Springer, 2000)We present an application of the ACL2 theorem prover to formalize and reason about rewrite systems theory. This can be ...
-
Presentation
Using Maude
(Springer, 2000) -
Presentation
A Topological Study of the Upward Refinement Operators on ILP
(CEUR-WS, 2000) -
Article
Towards Maude 2.0
(Elsevier, 2000)Maude 2.0 is the new version of the Maude rewriting logic language currently under development. Maude 2.0’s three main ...
-
Article
Proyecto europeo Siridus
(Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001) -
Article
Some Results on LΔ n+1
(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.