24 search results - page 5 / 5 » Expressing generalizations in unification-based grammar form... |
CADE
2008
Springer
14 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
PPDP
2009
Springer
14 years 16 days ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
PPDP
2007
Springer
14 years 3 days ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
COLING
1990
13 years 7 months ago
1990
This paper presents some techniques that provide a standard parsing system for the analysis of ill-formed utterances. These techniques are feature generalization and heuristically...