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...
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
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...
We study revision programming, a logic-based mechanism for enforcing constraints on databases. The central concept of this approach is that of a justi ed revision based on a revisi...
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczyns...