3 search results - page 1 / 1 » Horn Programming in Linear Logic Is NP-Complete |
LICS
1992
IEEE
15 years 2 months ago
1992
IEEE
104
click to vote
PADL
2007
Springer
15 years 4 months ago
2007
Springer
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
ICFP
2007
ACM
15 years 10 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...