1321 search results - page 137 / 265 » Subtyping in Logical Form |
146
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
162
click to vote
RSCTC
2010
Springer
15 years 4 months ago
2010
Springer
RSCTC’2010 Discovery Challenge was a special event of Rough Sets and Current Trends in Computing conference. The challenge was organized in the form of an interactive on-line com...
180
click to vote
TCS
2010
15 years 4 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
153
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
- For modeling of change of terminal server load, the approach including representation of time series of server parameters in the form of fuzzy time series is used. Further in the...
153
click to vote
COLING
2010
15 years 1 months ago
2010
We present a probabilistic generative model for learning semantic parsers from ambiguous supervision. Our approach learns from natural language sentences paired with world states ...