838 search results - page 90 / 168 » From Natural Language to Formal Proof Goal |
146
click to vote
KR
1994
Springer
15 years 10 months ago
1994
Springer
A key problem in case-based reasoning is the representation, organization and maintenance of case libraries. While current approaches rely on heuristic and psychologically inspire...
150
click to vote
COLING
1996
15 years 7 months ago
1996
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
147
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
153
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
152
click to vote
ITCC
2005
IEEE
15 years 11 months ago
2005
IEEE
Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies ...