Sciweavers

522 search results - page 25 / 105
» Automating grammar comparison
Sort
View
ICRA
2006
IEEE
86views Robotics» more  ICRA 2006»
15 years 4 months ago
The Statistical Dynamics of Programmed Self-assembly
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
Nils Napp, Samuel Burden, Eric Klavins
MICAI
2004
Springer
15 years 4 months ago
Automatic Enrichment of Very Large Dictionary of Word Combinations on the Basis of Dependency Formalism
The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sen...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
ACL
2011
14 years 2 months ago
Using Derivation Trees for Treebank Error Detection
This work introduces a new approach to checking treebank consistency. Derivation trees based on a variant of Tree Adjoining Grammar are used to compare the annotation of word sequ...
Seth Kulick, Ann Bies, Justin Mott
ENTCS
2002
79views more  ENTCS 2002»
14 years 10 months ago
Debugging and Testing Optimizers through Comparison Checking
We present a novel technique called comparison checking that helps optimizer writers debug optimizers by testing, for given inputs, that the semantics of a program are not changed...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
ICLP
2005
Springer
15 years 4 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli