399 search results - page 18 / 80 » Generating Referring Expressions with Reference Domain Theor... |
ACL
1997
13 years 9 months ago
1997
Most algorithms dedicated to the generation of referential descriptions widely suffer from a fundamental problem: they make too strong assumptions about adjacent processing compon...
ICDE
1994
IEEE
14 years 12 hour ago
1994
IEEE
In applications like nancial trading, scheduling, manufacturing and process control, time based predicates in queries and rules are very important. There is also a need to de ne ...
JSW
2007
13 years 7 months ago
2007
—Higher-order black box software tests against independent end user domain requirements has become an issue of increasing importance with compositional reuse of software artifact...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A theory, graphical notation, mathematical calculus and implementation for finding whether two given expressions can, at execution time, denote references attached to the same obje...
FM
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. UnifyingTheoriesofProgramming(UTP)canprovideaformalsemantic foundation not only for programming languages but also for more expressive specification languages. We believ...