4370 search results - page 305 / 874 » Algebra of Logic Programming |
CADE
1999
Springer
15 years 5 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...
110
click to vote
PPDP
2004
Springer
15 years 6 months 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...
114
click to vote
AGP
1997
IEEE
15 years 5 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 ...
104
Voted
ICFP
2008
ACM
16 years 21 days ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
80
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...