3738 search results - page 232 / 748 » Parametrized Logic Programming |
206
Voted
ICSM
2002
IEEE
16 years 1 days ago
2002
IEEE
Component recovery and remodularization is a means to get back control on large and complex legacy systems suffering from ad-hoc changes by recovering logical components and restr...
178
click to vote
CADE
1999
Springer
15 years 11 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...
202
click to vote
PPDP
2004
Springer
16 years 13 days ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
209
click to vote
AGP
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
194
click to vote
ICTCS
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. An extension of the λ-calculus is proposed to study historybased access control. It allows for parametrized security policies with a possibly nested, local scope. To gov...