Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
Abstract. Several options are available to relate agent logics to computational agent systems. Among others, one can try to find useful executable fragments of an agent logic or us...
This paper presents an approach for applying inductive logic programming to information extraction from HTML documents structured as unranked ordered trees. We consider information...
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...