The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...