Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics
- URL: http://arxiv.org/abs/2009.10246v1
- Date: Tue, 22 Sep 2020 00:49:52 GMT
- Title: Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics
- Authors: Tobias Geibinger, Hans Tompits
- Abstract summary: We introduce uniform axiomatisations for a family of nonmonotonic paraconsistent logics based on minimal inconsistency in terms of sequent-type proof systems.
We provide sequent-type calculi for Priest's three-valued minimally inconsistent logic of paradox, and for four-valued paraconsistent inference relations due to Arieli and Avron.
- Score: 2.627046865670577
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Paraconsistent logics constitute an important class of formalisms dealing
with non-trivial reasoning from inconsistent premisses. In this paper, we
introduce uniform axiomatisations for a family of nonmonotonic paraconsistent
logics based on minimal inconsistency in terms of sequent-type proof systems.
The latter are prominent and widely-used forms of calculi well-suited for
analysing proof search. In particular, we provide sequent-type calculi for
Priest's three-valued minimally inconsistent logic of paradox, and for
four-valued paraconsistent inference relations due to Arieli and Avron. Our
calculi follow the sequent method first introduced in the context of
nonmonotonic reasoning by Bonatti and Olivetti, whose distinguishing feature is
the use of a so-called rejection calculus for axiomatising invalid formulas. In
fact, we present a general method to obtain sequent systems for any many-valued
logic based on minimal inconsistency, yielding the calculi for the logics of
Priest and of Arieli and Avron as special instances.
Related papers
- A Primer for Preferential Non-Monotonic Propositional Team Logics [0.0]
We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations.
Motivated by the non-classical interpretation of disjunction in team semantics, we give a precise characterization for preferential models for propositional dependence logic.
arXiv Detail & Related papers (2024-05-11T09:53:15Z) - A Semantic Approach to Decidability in Epistemic Planning (Extended
Version) [72.77805489645604]
We use a novel semantic approach to achieve decidability.
Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity.
We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
arXiv Detail & Related papers (2023-07-28T11:26:26Z) - A Hybrid System for Systematic Generalization in Simple Arithmetic
Problems [70.91780996370326]
We propose a hybrid system capable of solving arithmetic problems that require compositional and systematic reasoning over sequences of symbols.
We show that the proposed system can accurately solve nested arithmetical expressions even when trained only on a subset including the simplest cases.
arXiv Detail & Related papers (2023-06-29T18:35:41Z) - An Embedding-based Approach to Inconsistency-tolerant Reasoning with
Inconsistent Ontologies [12.760301272393898]
We propose a novel approach to reasoning with inconsistent semantics based on the embeddings of axioms.
We show that our embedding-based method can outperform existing inconsistency-tolerant reasoning methods based on maximal consistent subsets.
arXiv Detail & Related papers (2023-04-04T09:38:02Z) - Non-Deterministic Approximation Fixpoint Theory and Its Application in
Disjunctive Logic Programming [11.215352918313577]
Approximation fixpoint theory is a framework for studying the semantics of nonmonotonic logics.
We extend AFT to dealing with non-deterministic constructs that allow to handle indefinite information.
The applicability and usefulness of this generalization is illustrated in the context of disjunctive logic programming.
arXiv Detail & Related papers (2022-11-30T18:58:32Z) - MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure [129.8481568648651]
We propose a benchmark to investigate models' logical reasoning capabilities in complex real-life scenarios.
Based on the multi-hop chain of reasoning, the explanation form includes three main components.
We evaluate the current best models' performance on this new explanation form.
arXiv Detail & Related papers (2022-10-22T16:01:13Z) - Logical Credal Networks [87.25387518070411]
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability.
We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
arXiv Detail & Related papers (2021-09-25T00:00:47Z) - Refining Labelled Systems for Modal and Constructive Logics with
Applications [0.0]
This thesis serves as a means of transforming the semantics of a modal and/or constructive logic into an 'economical' proof system.
The refinement method connects two proof-theoretic paradigms: labelled and nested sequent calculi.
The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics.
arXiv Detail & Related papers (2021-07-30T08:27:15Z) - Uncertain Linear Logic via Fibring of Probabilistic and Fuzzy Logic [0.0]
probabilistic and fuzzy logic correspond to two different assumptions regarding the combination of propositions whose evidence bases are not currently available.
It is shown that these two sets of formulas provide a natural grounding for the multiplicative and additive operator-sets in linear logic.
The concept of linear logic as a logic of resources" is manifested here via the principle of conservation of evidence"
arXiv Detail & Related papers (2020-09-28T00:19:42Z) - Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic.
Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
arXiv Detail & Related papers (2020-08-06T02:13:11Z) - Logical Neural Networks [51.46602187496816]
We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning)
Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation.
Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
arXiv Detail & Related papers (2020-06-23T16:55:45Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.