6618 search results - page 300 / 1324 » Natural Logic for Natural Language |
164
click to vote
AML
2006
15 years 6 months ago
2006
If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate log...
156
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
176
click to vote
ECAI
2004
Springer
16 years 4 days ago
2004
Springer
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying many AI uncertainty for...
188
click to vote
ESOP
2005
Springer
16 years 8 days ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
168
click to vote
AMAI
2004
Springer
16 years 4 days ago
2004
Springer
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...