315 search results - page 31 / 63 » Using Logic in the Generation of Referring Expressions |
CORR
1998
Springer
15 years 1 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...
125
click to vote
ICSE
2005
IEEE-ACM
16 years 2 months ago
2005
IEEE-ACM
Existing spreadsheet systems allow users to change cells arbitrarily, which is a major source of spreadsheet errors. We propose a system that prevents errors in spreadsheets by re...
130
Voted
ESOP
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
107
click to vote
LICS
2002
IEEE
15 years 6 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
146
click to vote
ICFP
2012
ACM
13 years 4 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...