Auflistung nach Schlagwort "Dependence logic"

Sortiert nach: Sortierung: Ergebnisse:

  • Axiomatizing propositional dependence logics 
    Sano, Katsuhiko; Virtema, Jonni (Wadern : Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, 2015)
    We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional ...
  • Computational aspects of dependence logic 
    Lohmann, Peter (Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2012)
    [no abstract]
  • Decidability of predicate logics with team semantics 
    Kontinen, Juha; Kuusisto, Antti; Virtema, Jonni (Saarbrücken : Dagstuhl Publishing, 2016)
    We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIMEcomplete. Furthermore, we show that the ...
  • Dependence logic with a majority quantifier 
    Durand, Arnaud; Ebbing, Johannes; Kontinen, Juha; Vollmer, Heribert (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2011)
    We study the extension of dependence logic D by a majority quantifier M over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers ...
  • On quantified propositional logics and the exponential time hierarchy 
    Hannula, Miika; Kontinen, Juha; Lück, Martin; Virtema, Jonni (Waterloo, NSW : Open Publishing Association, 2016)
    We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified ...
  • Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals 
    Hannula, Miika; Virtema, Jonni (Amsterdam [u.a.] : Elsevier, 2022)
    Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We ...
  • A van Benthem theorem for modal team semantics 
    Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert (Wadern : Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, 2015)
    The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework ...