Browsing by Subject "Satisfiability"

Sort by: Order: Results:

  • Canonical models and the complexity of modal team logic 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We study modal team logic MTL, the team-semantical extension of classical modal logic closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, ...
  • The complexity of generalized satisfiability for linear temporal logic 
    Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert (Braunschweig : International Federation for Computational Logic, 2009)
    In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set ...
  • The Complexity of Satisfiability for Fragments of CTL and CTL⋆ 
    Meier, Arne; Mundhenk, Martin; Thomas, Michael; Vollmer, Heribert (Amsterdam : Elsevier BV, 2008)
    The satisfiability problems for CTL and CTL⋆ are known to be EXPTIME-complete, resp. 2EXPTIME-complete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, ...
  • On the complexity of team logic and its two-variable fragment 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We study the logic FO(∼), the extension of first-order logic with team semantics by unrestricted Boolean negation. It was recently shown to be axiomatizable, but otherwise has not yet received much attention in questions ...
  • Parameterised complexity of model checking and satisfiability in propositional dependence logic 
    Mahmood, Yasir; Meier, Arne (Dordrecht [u.a.] : Springer Science + Business Media B.V, 2021)
    Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations with respect to central decision problems. The model checking ...
  • Team semantics for the specification and verification of hyperproperties 
    Krebs, Andreas; Meier, Arne; Virtema, Jonni; Zimmermann, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an ...