# Streamlining Input/Output Logics with Sequent Calculi

arXiv: https://arxiv.org/abs/2306.09496 · HTML: https://mlsanity.com/paper/2306.09496/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Jun 2023.

## Built on by (most cited first, 2 of 2)

- [A Reduction of Input/Output Logics to SAT](https://mlsanity.com/paper/2508.16242/) (2025)
- [Defeasible Conditional Obligation in a Two-tiered Preference-based Semantics (Extended Version)](https://mlsanity.com/paper/2604.26977/) (2026)

## Abstract (arXiv)

Input/Output (I/O) logic is a general framework for reasoning about conditional norms and/or causal relations. We streamline Bochman's causal I/O logics via proof-search-oriented sequent calculi. Our calculi establish a natural syntactic link between the derivability in these logics and in the original I/O logics. As a consequence of our results, we obtain new, simple semantics for all these logics, complexity bounds, embeddings into normal modal logics, and efficient deduction methods. Our work encompasses many scattered results and provides uniform solutions to various unresolved problems.