Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Abstract. This paper is a first step in the direction of extending possibilistic planning to take advantage of the expressive power and reasoning capabilities of fuzzy description...
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin