#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1980

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Didier Galmiche, Guy Perrier
- Theor. Comput. Sci.
- 1994

We present a proof-theoretic foundation for automated deduction in linear logic. At rst, we systematically study the permutability properties of the inference rules in this logical framework and exploit these to introduce an appropriate notion of forward and backward movement of an inference in a proof. Then we discuss the naturally-arising question of the… (More)

- Guy Perrier
- COLING
- 2000

Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures. Syntactic composition is represented as a chemical reaction guided by the saturation of polarities. It is expressed in a… (More)

Mammals owe part of their evolutionary success to the harmonious exchanges of information, energy and immunity between females and their offspring. This functional reciprocity is vital for the survival and normal development of infants, and for the inclusive fitness of parents. It is best seen in the intense exchanges taking place around the mother's… (More)

- Didier Galmiche, Guy Perrier
- LFCS
- 1994

In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving logical foundations for the design of proof search strategies. We propose common theoretical foundations for top-down, bottom-up and mixed proof search procedures with a systematic formalization of strategies construction using the notions of immediate or… (More)

- Guillaume Bonfante, Bruno Guillaume, Guy Perrier
- COLING
- 2004

In the context of lexicalized grammars, we propose general methods for lexical disam-biguation based on polarization and abstraction of grammatical formalisms. Polarization makes their resource sensitivity explicit and abstraction aims at keeping essentially the mechanism of neutralization between polarities. Parsing with the simplified grammar in the… (More)

Taking an asynchronous perspective on the syntax-semantics interface, we propose to use modular graph rewriting systems as the model of computation. We formally define them and demonstrate their use with a set of modules which produce underspecified semantic representations from a syntactic dependency graph. We experimentally validate this approach on a set… (More)

A knowledge of the rotatory motion of the vertebral bodies is needed to understand the normal biomechanical behavior of the spine. The aims of this investigation were 1) to define the instantaneous axis of rotation of the lumbar spine in rotation; and 2) to study the effect of the loss of the anulus, facet joints, and ligamentous structures on the location… (More)

- Jonathan Marchand, Bruno Guillaume, Guy Perrier
- ArXiv
- 2010

Cet article propose une méthode pour calculer les dépendances syntaxiques d'un´ enoncéà partir du processus d'analyse en constituants. L'objectif est d'obtenir des dépendancescompì etes c'est-` a-dire contenant toutes les informations nécessairesà la construction de la sémantique. Pour l'analyse en constituants, on utilise le formalisme des grammaires… (More)

- Guy Perrier
- Theor. Comput. Sci.
- 1998

In 1, Section 5.1, pages 86-88], the authors propose a new proof of cut-elimination in linear logic that uses the framework of the sequent calculus and they present it as a result derived from their central outcome on inference permutability in linear logic. This result is formalised in 1, Theorem 5.2, page 87]. To prove Theorem 5.2, the authors assume a… (More)

- Claire Gardent, Bruno Guillaume, Guy Perrier, Ingrid Falk, Nancy 2LORIA
- 2005

Maurice Gross' grammar lexicon contains an extremly rich and exhaustive information about the morphosyntactic and semantic properties of French syntactic functors (verbs, adjectives, nouns). Yet its use within natural language processing systems is still restricted. In this paper, we first argue that the information contained in the grammar lexicon is… (More)