Sciweavers

555 search results - page 19 / 111
» Decompositions of Grammar Constraints
Sort
View
ACL
2009
13 years 5 months ago
An Earley Parsing Algorithm for Range Concatenation Grammars
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley pars...
Laura Kallmeyer, Wolfgang Maier, Yannick Parmentie...
ICPR
2006
IEEE
14 years 8 months ago
Automatic Adjacency Grammar Generation from User Drawn Sketches
In this paper we present an innovative approach to automatically generate adjacency grammars describing graphical symbols. A grammar production is formulated in terms of rulesets ...
Joan Mas Romeu, Bart Lamiroy, Gemma Sánchez...
MP
2008
117views more  MP 2008»
13 years 7 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph
TSE
2008
107views more  TSE 2008»
13 years 7 months ago
Interface Grammars for Modular Software Model Checking
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
Graham Hughes, Tevfik Bultan
CC
1998
Springer
134views System Software» more  CC 1998»
13 years 11 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson