Cover Image

Logics with probabilistic team semantics and the Boolean negation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hannula, Miika, Hirvonen, Minna, Kontinen, Juha, Mahmood, Yasir, Meier, Arne, Virtema, Jonni
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Logic and Computation through the Lens of Semirings
by: Barlag, Timon, et al.
Published: (2025)

Aspects of Coherence in Dependence Logic
by: Barlag, Timon, et al.
Published: (2026)

Temporal Team Semantics Revisited
by: Gutsfeld, Jens Oliver, et al.
Published: (2021)

A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL
by: Kontinen, Juha, et al.
Published: (2024)

Dichotomy for Axiomatising Inclusion Dependencies on K-Databases
by: Hannula, Miika, et al.
Published: (2026)

Logical Approaches to Non-deterministic Polynomial Time over Semirings
by: Barlag, Timon, et al.
Published: (2025)

Synchronous Team Semantics for Temporal Logics
by: Krebs, Andreas, et al.
Published: (2024)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
by: Antonelli, Melissa, et al.
Published: (2025)

Rejection in Abstract Argumentation: Harder Than Acceptance?
by: Fichte, Johannes K., et al.
Published: (2024)

Parameterised Complexity of Consistent Query Answering via Graph Representations
by: Hankala, Teemu, et al.
Published: (2024)

On the expressive power of inquisitive team logic and inquisitive first-order logic
by: Kontinen, Juha, et al.
Published: (2026)

A SUBSET-SUM Characterisation of the A-Hierarchy
by: Gutleben, Jan, et al.
Published: (2024)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
by: Krebs, Andreas, et al.
Published: (2025)

A logic-based framework for database repairs
by: Fröhlich, Nicolas, et al.
Published: (2023)

The flattening operator in team-based logics
by: Durand, Arnaud, et al.
Published: (2025)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

Unifying approach to uniform expressivity of graph neural networks
by: Luo, Huan, et al.
Published: (2026)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)

Model Counting for Dependency Quantified Boolean Formulas
by: Fung, Long-Hin, et al.
Published: (2025)

The Implication Problem for Functional Dependencies and Variants of Marginal Distribution Equivalences
by: Hirvonen, Minna
Published: (2023)

Implication Problems over Positive Semirings
by: Hirvonen, Minna
Published: (2025)

On the Complexity and Properties of Preferential Propositional Dependence Logic
by: Sauerwald, Kai, et al.
Published: (2025)

Representation Theorems for Cumulative Propositional Dependence Logics
by: Kontinen, Juha, et al.
Published: (2026)

On the Complexity of Entailment for Cumulative Propositional Dependence Logics
by: Sauerwald, Kai, et al.
Published: (2026)

Finite Variable Counting Logics with Restricted Requantification
by: Raßmann, Simon, et al.
Published: (2024)

Epistemic Skills: Logical Dynamics of Knowing and Forgetting
by: Liang, Xiaolong, et al.
Published: (2024)

The Complexity and Expressive Power of Second-Order Extended Logic
by: Feng, Shiguang, et al.
Published: (2022)

The Unit Gap: How Sharing Works in Boolean Circuits
by: Krinkin, Kirill
Published: (2026)

There are (other) ways to negate in propositional team semantics
by: Yang, Fan
Published: (2024)

Rice-like complexity lower bounds for Boolean and uniform automata networks
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)

Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable
by: Mouli, Sasank
Published: (2024)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
by: Ježil, Ondřej, et al.
Published: (2026)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)