782 search results - page 148 / 157 » Can a Parser be Generated from Examples |
142
Voted
FASE
2006
Springer
15 years 7 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
133
Voted
DBPL
1995
Springer
15 years 7 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
150
click to vote
CASCON
2007
15 years 5 months ago
2007
We present preliminary work on an IDE for formal software development using tabular expressions as the basis for precise specifications and descriptions of software behaviour. 1 ...
171
Voted
CCCG
1998
15 years 5 months ago
1998
Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary re...
162
Voted
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
The two main questions in coalition games are 1) what coalitions should form and 2) how to distribute the value of each coalition between its members. When a game is not superaddit...