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...
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...
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kie...
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...
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
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...