We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
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...
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...