304 search results - page 1 / 61 » A dynamic programming approach to categorial deduction |
CADE
1999
Springer
13 years 9 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
TYPES
1995
Springer
13 years 8 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
ESOP
2005
Springer
13 years 10 months 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...
DOOD
1991
Springer
13 years 8 months ago
1991
Springer
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
DAC
2006
ACM
14 years 6 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...