6 found
Sort by:
  1. Oliver Friedmann & Martin Lange (2013). Deciding the Unguarded Modal -Calculus. Journal of Applied Non-Classical Logics 23 (4):353-371.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Holger Richly, Martin Lange, Elisabeth Simboeck & Luciano Di Croce (2010). Setting and Resetting of Epigenetic Marks in Malignant Transformation and Development. Bioessays 32 (8):669-679.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Martin Lange (2009). Model Checking for Hybrid Logic. Journal of Logic, Language and Information 18 (4):465-491.
    We consider the model checking problem for Hybrid Logic. Known algorithms so far are global in the sense that they compute, inductively, in every step the set of all worlds of a Kripke structure that satisfy a subformula of the input. Hence, they always exploit the entire structure. Local model checking tries to avoid this by only traversing necessary parts of the input in order to establish or refute the satisfaction relation between a given world and a formula. We present (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. Anders Søgaard & Martin Lange (2009). Polyadic Dynamic Logics for Hpsg Parsing. Journal of Logic, Language and Information 18 (2):159-198.
    Head-driven phrase structure grammar (HPSG) is one of the most prominent theories employed in deep parsing of natural language. Many linguistic theories are arguably best formalized in extensions of modal or dynamic logic (Keller, Feature logics, infinitary descriptions and grammar, 1993; Kracht, Linguistics Philos 18:401–458, 1995; Moss and Tiede, In: Blackburn, van Benthem, and Wolther (eds.) Handbook of modal logic, 2006), and HPSG seems to be no exception. Adequate extensions of dynamic logic have not been studied in detail, however; the (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Martin Lange (2005). A Quick Axiomatisation of LTL with Past. Mathematical Logic Quarterly 51 (1):83-88.
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  6. Martin Lange & Carsten Lutz (2005). 2-ExpTime Lower Bounds for Propositional Dynamic Logics with Intersection. Journal of Symbolic Logic 70 (4):1072-1086.
    In 1984, Danecki proved that satisfiability in IPDL, i.e., Propositional Dynamic Logic (PDL) extended with an intersection operator on programs, is decidable in deterministic double exponential time. Since then, the exact complexity of IPDL has remained an open problem: the best known lower bound was the ExpTime one stemming from plain PDL until, in 2004, the first author established ExpSpace-hardness. In this paper, we finally close the gap and prove that IPDL is hard for 2-ExpTime, thus 2-ExpTime-complete. We then sharpen (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation