3481 search results - page 79 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
156
Voted
ASP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
101
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
159
Voted
ASP
2003
Springer
15 years 7 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
126
Voted
CP
2004
Springer
15 years 8 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...
126
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...