Handsome Non-Commutative Proof-Nets: perfect matchings, series-parallel orders and Hamiltonian circuits
hal.structure.identifier | Linear logic, proof networks and categorial grammars [CALLIGRAMME] | |
dc.contributor.author | POGODALLA, Sylvain | |
hal.structure.identifier | Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES] | |
dc.contributor.author | RETORÉ, Christian | |
dc.date.accessioned | 2024-04-15T09:45:12Z | |
dc.date.available | 2024-04-15T09:45:12Z | |
dc.date.created | 2004-12 | |
dc.date.issued | 2004 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197896 | |
dc.description.abstractEn | This paper provides a definition of proof-nets for non-commutative linear logic (cyclic linear logic and Lambek calculus) where there are no links, that are small graphs representing the connectives. Instead of a tree like representation with links, the formula is depicted as a graph representing the conclusion up to the algebraic properties of the connectives. In the commutative case the formula is viewed as a cograph. In the non-commutative case it is a more complicated kind of graph which is, roughly speaking, a directed cograph. The criterion consists in the commutative condition plus a bracketing condition. | |
dc.language.iso | en | |
dc.subject.en | proof theory | |
dc.subject.en | linear logic | |
dc.subject.en | graph theory | |
dc.subject.en | perfect matching | |
dc.subject.en | cographs | |
dc.subject.en | cyclic orders | |
dc.subject.en | computational linguistics | |
dc.subject.en | lambek calculus | |
dc.subject.en | categorial grammars | |
dc.title.en | Handsome Non-Commutative Proof-Nets: perfect matchings, series-parallel orders and Hamiltonian circuits | |
dc.type | Rapport | |
dc.subject.hal | Informatique [cs]/Autre [cs.OH] | |
bordeaux.page | 25 | |
bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.type.institution | INRIA | |
bordeaux.type.report | rr | |
hal.identifier | inria-00071248 | |
hal.version | 1 | |
hal.audience | Non spécifiée | |
hal.origin.link | https://hal.archives-ouvertes.fr//inria-00071248v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2004&rft.spage=25&rft.epage=25&rft.au=POGODALLA,%20Sylvain&RETOR%C3%89,%20Christian&rft.genre=unknown |
Fichier(s) constituant ce document
Fichiers | Taille | Format | Vue |
---|---|---|---|
Il n'y a pas de fichiers associés à ce document. |