1101 search results - page 121 / 221 » Forcing in proof theory |
94
Voted
FP
1995
15 years 4 months ago
1995
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type...
104
click to vote
DAC
2005
ACM
15 years 2 months ago
2005
ACM
This paper presents a new test response compaction technique with any number of unknown logic values (X’s) in the test response bits. The technique leverages an X-tolerant respo...
87
Voted
EACL
1993
ACL Anthology
15 years 2 months ago
1993
ACL Anthology
In the paper it is argued that for some linguistic phenomena, current discourse representation structures are insufficiently finegrained, both from the perspective of serving as r...
AAAI
2010
15 years 27 days ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
87
Voted
AMC
2007
15 years 24 days ago
2007
In this paper, we consider an integrated pest management model which is impulsively controlled by means of biological and chemical controls. These controls are assumed to act in a...