Sciweavers

1000 search results - page 11 / 200
» Nominal rewriting systems
Sort
View
IPM
2010
128views more  IPM 2010»
14 years 8 months ago
A knowledge-rich approach to identifying semantic relations between nominals
This paper describes a supervised, knowledge-intensive approach to the automatic identification of semantic relations between nominals in English sentences. The system employs di...
Roxana Girju, Brandon Beamer, Alla Rozovskaya, A. ...
ACL
1992
14 years 10 months ago
Recognition of Linear Context-Free Rewriting Systems
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
Giorgio Satta
AUTOMATICA
2005
87views more  AUTOMATICA 2005»
14 years 9 months ago
Plasma vertical stabilization with actuation constraints in the DIII-D tokamak
In the advanced tokamak (AT) operating mode of the DIII-D tokamak, an integrated multivariable controller takes into account highly coupled influences of plasma equilibrium shape,...
Eugenio Schuster, M. L. Walker, D. A. Humphreys, M...
BIRTHDAY
2005
Springer
15 years 3 months ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
Fabio Gadducci, Ugo Montanari
FOSSACS
2005
Springer
15 years 3 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto