764 search results - page 71 / 153 » On the Expressibility of Stable Logic Programming |
183
click to vote
POPL
2007
ACM
16 years 5 days ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
120
click to vote
DOOD
1991
Springer
15 years 3 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...
ATVA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
104
click to vote
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
114
click to vote
NMELP
1994
15 years 4 months ago
1994
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...