Logics with probabilistic team semantics and the Boolean negation
From MaRDI portal
Publication:6545573
DOI10.1007/978-3-031-43619-2_45MaRDI QIDQ6545573FDOQ6545573
Authors: Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema 
Publication date: 29 May 2024
computational complexitymodel checkingsatisfiabilityvalidityprobabilistic team semanticsexpressivity of logics
Cites Work
- Probabilistic team semantics
- Dependence logic. A new approach to independence friendly logic
- Compositional semantics for a language of imperfect information
- A logic for arguing about probabilities in measure teams
- Title not available (Why is that?)
- Metafinite model theory
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Fixed points, Nash equilibria, and the existential theory of the reals
- Complexity of propositional logics in team semantic
- Team logic and second-order logic
- Title not available (Why is that?)
- Descriptive complexity of real computation and probabilistic independence logic
- Title not available (Why is that?)
- Approximation and dependence via multiteam semantics
- Facets of distribution identities in probabilistic team semantics
- On elementary logics for quantitative dependencies
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
- Tractability Frontier of Data Complexity in Team Semantics
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Complexity thresholds in inclusion logic
This page was built for publication: Logics with probabilistic team semantics and the Boolean negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545573)
