291 search results - page 2 / 59 » On the Complexity of Fragments of Modal Logics |
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
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), ...
ACTA
2004
14 years 9 months ago
2004
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...
78
Voted
ITA
2007
14 years 9 months ago
2007
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...
LMCS
2007
14 years 9 months ago
2007
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...
MLQ
2008
14 years 9 months ago
2008
We observe that removing contraction from a standard sequent calculus for first-order predicate logic preserves completeness for the modal fragment.