Pith. sign in

REVIEW 1 cited by

Modular SAT-based techniques for reasoning tasks in team semantics

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.00576 v1 pith:ESYX6AJF submitted 2022-04-01 cs.LO

Arnaud Durand , Juha Kontinen , Jouko Väänänen This is my paper
classification cs.LO
keywords problemsapproachcomplexitymodularreasoningresultssemanticstasks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on modular reductions of these problems into the corresponding problems of various classes of Boolean formulas. We illustrate our approach via several new tractability/intractability results.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The flattening operator in team-based logics

    cs.LO 2025-05 reject novelty 6.0 of 10

    The flattening operator F increases the expressive power of unary inclusion and unary anonymity logics, but the submitted proofs for the inclusion-logic equivalence and the anonymity separation contain critical gaps.

Pith tools