Enviaments recents

  • The Plogi and ACi-1 operators on the polynomial time hierarchy 

    Castro Rabal, Jorge; Seara Ojea, Carlos (1993-11)
    Report de recerca
    Accés obert
    In a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ...
  • Syntactic connectivity 

    Morrill, Glyn (1998-03)
    Report de recerca
    Accés obert
    Type logical grammar presents a paradigm of linguistic description based on what we may refer to as a Lambek-van Benthem correspondence: (logical) formulas as (linguistic) categories. Lexical signs are classified ...
  • Memoisation of categorial proof nets: parallelism in categorial processing 

    Morrill, Glyn (1996-02)
    Report de recerca
    Accés obert
    We introduce a method of memoisation of categorial proof nets. Exploiting the planarity of non-commutative proof nets, and unifiability as a correctness criterion, parallelism is simulated through construction of a ...
  • Learnability of Kolmogorov-easy circuit expressions via queries 

    Balcázar Navarro, José Luis; Buhrman, H; Hermo, M (1995-02)
    Report de recerca
    Accés obert
    Circuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We ...
  • Higher-order linear logic programming of categorial deduction 

    Morrill, Glyn (1994-10)
    Report de recerca
    Accés obert
    We show how categorial deduction can be implemented in (higher-order) linear logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of ...
  • Incremental processing and acceptability 

    Morrill, Glyn (1998-09)
    Report de recerca
    Accés obert
    We present a left to right incremental algorithm for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly ...
  • Discontinuity and pied-piping in categorial grammar 

    Morrill, Glyn (1993-06)
    Report de recerca
    Accés obert
    Discontinuity refers to the phenomena in many natural language constructions whereby signs differ markedly in their prosodic and semantic forms. As such it presents interesting demands on monostratal computational formalisms ...
  • Clausal proof nets and discontinuity 

    Morrill, Glyn (1994-03)
    Report de recerca
    Accés obert
    We consider the task of theorem proving in Lambek calculi and their generalisation to "multimodal residuation calculi". These form an integral part of categorial logic, a logic of signs stemming from categorial grammar, ...
  • A Transformation scheme for double recursion 

    Balcázar Navarro, José Luis (1994-02)
    Report de recerca
    Accés obert
    A tail recursive program (with a single recursive call per case) is derived from a generic recursive program with two independent recursive calls, under no algebraic hypothesis whatsoever. The iterative version, fully ...
  • A Note on learning decision lists 

    Castro Rabal, Jorge (1995-01)
    Report de recerca
    Accés obert
    We show an algorithm that learns decision lists via equivalence queries, provided that a set G including all terms of the target list is given. The algorithm runs in time polynomial in the cardinality of G. From this last ...

Mostra'n més