Add to ORKGWe 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 proof net matrix of most general unifiers for modules, in a manner analogous to the Cocke-Younger-Kasami algorithm for context free grammar
Boolean proof nets were introduced by Terui in [8] to study the implicit complexity of proofs nets f...
AbstractThis article presents an overview of a framework called categorial grammars from a theoretic...
AbstractWe introduce a general critical-pair/completion algorithm, formulated in the language of cat...
We introduce a method of memoisation of categorial proof nets. Exploiting the planarity of non-com...
ABSTRACT. We present a novel way of using proof nets for multimodal categorial grammars, which provi...
Girard (1987) introduced proof nets as a syntax of linear proofs which eliminates inessential rule o...
Colloque avec actes et comité de lecture.We reduce the provability problem of any formula of the Lam...
Abstract Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel...
This chapter argues for a novel method to machine learn patterns in formal proofs using statistical ...
We consider the task of theorem proving in Lambek calculi and their generalisation to "multimodal re...
In this paper we will look at automated theorem proving for categorial grammar logics. Taking linear...
Abstract. We present an algebraic view on logic programming, related to proof theory and more specif...
The goal of this paper is to demonstrate how the very rich notion of proofnet may be used, in the fr...
We present a left to right incremental algorithm for the processing of Lambek categorial grammar by ...
AbstractA graph-theoretical look at multiplicative proof nets lead us to two new descriptions of a p...
Boolean proof nets were introduced by Terui in [8] to study the implicit complexity of proofs nets f...
AbstractThis article presents an overview of a framework called categorial grammars from a theoretic...
AbstractWe introduce a general critical-pair/completion algorithm, formulated in the language of cat...
We introduce a method of memoisation of categorial proof nets. Exploiting the planarity of non-com...
ABSTRACT. We present a novel way of using proof nets for multimodal categorial grammars, which provi...
Girard (1987) introduced proof nets as a syntax of linear proofs which eliminates inessential rule o...
Colloque avec actes et comité de lecture.We reduce the provability problem of any formula of the Lam...
Abstract Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel...
This chapter argues for a novel method to machine learn patterns in formal proofs using statistical ...
We consider the task of theorem proving in Lambek calculi and their generalisation to "multimodal re...
In this paper we will look at automated theorem proving for categorial grammar logics. Taking linear...
Abstract. We present an algebraic view on logic programming, related to proof theory and more specif...
The goal of this paper is to demonstrate how the very rich notion of proofnet may be used, in the fr...
We present a left to right incremental algorithm for the processing of Lambek categorial grammar by ...
AbstractA graph-theoretical look at multiplicative proof nets lead us to two new descriptions of a p...
Boolean proof nets were introduced by Terui in [8] to study the implicit complexity of proofs nets f...
AbstractThis article presents an overview of a framework called categorial grammars from a theoretic...
AbstractWe introduce a general critical-pair/completion algorithm, formulated in the language of cat...