6554 search results - page 345 / 1311 » Constraint Logic Programming |
194
click to vote
ICSM
2002
IEEE
15 years 11 months 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...
162
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...
187
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 ...
152
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
179
click to vote
ICFP
2008
ACM
16 years 6 months 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...