Hypersequent Calculi for Propositional Default Logics

In this article, we investigate default reasoning from a structural proof-theoretic perspective. We introduce hybrid hypersequent calculi for propositional default logics, where extra-logical rules directly capture default rules, while parallel composition of sequents and antisequents formalizes contrary updating on the conclusions of extra-logical rules. We establish the admissibility of structural rules and the invertibility of logical rules, showing that cut-free proofs exhibit a weakened form of analyticity. Next, we prove that specific hybrid hypersequent calculi are sound and weakly complete with respect to credulous consequence based on Łukaszewicz extensions. Lastly, we propose a hypersequent-based decision method for skeptical consequence which circumvents the need for early computation of all extensions.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Computational Logic
Published
2025-03-25
DOI
https://doi.org/10.1145/3725849
Citations
2
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hypersequent Calculi for Propositional Default Logics

Mario Piazza, Andrea Sabatini
2 citations
ACM Transactions on Computational Logic
Logic, Reasoning, and Knowledge
4.96
article

Hypersequent Calculi for Propositional Default Logics

Mario Piazza, Andrea Sabatini
article en
2 citations

Abstract

In this article, we investigate default reasoning from a structural proof-theoretic perspective. We introduce hybrid hypersequent calculi for propositional default logics, where extra-logical rules directly capture default rules, while parallel composition of sequents and antisequents formalizes contrary updating on the conclusions of extra-logical rules. We establish the admissibility of structural rules and the invertibility of logical rules, showing that cut-free proofs exhibit a weakened form of analyticity. Next, we prove that specific hybrid hypersequent calculi are sound and weakly complete with respect to credulous consequence based on Łukaszewicz extensions. Lastly, we propose a hypersequent-based decision method for skeptical consequence which circumvents the need for early computation of all extensions.

ACM Transactions on Computational LogicVol. 26(3)
Scuola Normale Superiore (IT)
Openalex Percentile: Top 6%
Logic, Reasoning, and Knowledge
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Hypersequent Calculi for Propositional Default Logics — Mario Piazza, Andrea Sabatini · ACM Transactions on Computational Logic (2025) | TGRS Research Map | TGRS