Now showing items 1-20 of 156

    • Icon
    • Icon

      Lexical Object Theory: Specification Level  [Article]

      Quesada Moreno, José Francisco (Springer, 1998)
      Unification has become a major paradigm in Mathematical and Computational Linguistics. The research done in this area may be classified in four main streams: feature structures as an adequate model for the description of ...
    • Icon

      Maude as a Metalanguage  [Article]

      Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí Oliet, N.; Meseguer, J.; Quesada Moreno, José Francisco (Elsevier, 1998)
      One of the key goals of rewriting logic from its beginning has been to provide a semantic and logical framework in which many models of computation and languages can be naturally represented. There is by now very extensive ...
    • Icon
    • Icon
    • Icon

      Towards Maude 2.0  [Article]

      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 ...
    • Icon

      Integration of dialogue moves and speech recognition in a telephone scenario  [Article]

      Quesada Moreno, José Francisco; Amores Carredano, José Gabriel De; Ballesteros, Rafael (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
    • Icon

      Proyecto europeo D'Homme  [Article]

      Quesada Moreno, José Francisco; Amores Carredano, José Gabriel De (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
    • Icon

      Dialogue Moves for Natural Command Languages  [Article]

      Amores Carredano, José Gabriel De; Quesada Moreno, José Francisco (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
    • Icon

      Some Results on LΔ n+1  [Article]

      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.
    • Icon

      Proyecto europeo Siridus  [Article]

      Quesada Moreno, José Francisco; Amores Carredano, José Gabriel De (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
    • Icon

      Dialogue Management in a Home Machine Environment: Linguistic Components over an Agent Architecture  [Article]

      Quesada Moreno, José Francisco; García, Federico; Sena, Esther; Bernal, José Ángel; Amores Carredano, José Gabriel De (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
      This paper presents the main characteristics of an Agent{based Architecture for the design and implementation of a Spoken Dialogue System. From a theoretical point of view, the system is based on the Information State ...
    • Icon

      Parsing bidimensional de estructuras DAG mediante el algoritmo SCP y su aplicación al reconocimiento de habla  [Article]

      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. ...
    • Icon

      Maude: specification and programming in rewriting logic  [Article]

      Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí Oliet, N.; Meseguer, J.; Quesada Moreno, José Francisco (Elsevier, 2002)
      Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational ...
    • Icon

      Formal proofs about rewriting using ACL2  [Article]

      Ruiz Reina, José Luis; Alonso Jiménez, José Antonio; Hidalgo Doblado, María José; Martín Mateos, Francisco Jesús (Springer, 2002)
      We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We describe the formalization and representation aspects of our work using the firstorder, quantifier-free logic of ACL2 and ...
    • Icon

      Modelado de diálogo basado en conocimiento, acciones y expectativas  [Article]

      Quesada Moreno, José Francisco (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2002)
      Este trabajo propone un modelo declarativo para el modelado de sistemas de gestión de diálogo. La estrategia propuesta se basa en una división funcional del sistema de gestión en cuatro niveles: especificación, interfaz ...
    • Icon

      Identification and Representation of Anaphoric Expressions in a Spoken Dialogue System  [Article]

      Sena, Esther; Amores Carredano, José Gabriel De; Quesada Moreno, José Francisco (Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2002)
    • Icon

      Recent Computability Models Inspired from Biology: DNA and Membrane Computing  [Article]

      Paun, Gheorghe; Pérez Jiménez, Mario de Jesús (Universidad del País Vasco, 2003)
      We briefly present two areas of natural computing, vividly investigated in the recent years: DNA computing and membrane computing. Both of them have the roots in cellular biology and are rather developed at the theoretical ...
    • Icon

      A Formal Proof of Dickson’s Lemma in ACL2  [Presentation]

      Martín Mateos, Francisco Jesús; Alonso Jiménez, José Antonio; Hidalgo Doblado, María José; Ruiz Reina, José Luis (Springer, 2003)
      Dickson’s Lemma is the main result needed to prove the termination of Buchberger’s algorithm for computing Gr¨obner basis of polynomial ideals. In this case study, we present a formal proof of Dickson’s Lemma using the ...
    • Icon

      Verification of the Formal Concept Analysis  [Article]

      Alonso Jiménez, José Antonio; Borrego Díaz, Joaquín; Hidalgo Doblado, María José; Martín Mateos, Francisco Jesús; Ruiz Reina, José Luis (Real Academia de Ciencias, 2004)
      This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to represent and formally verify some algorithms of this theory. We also develop a method to transform ...