DeepAI AI Chat
Log In Sign Up

Inference with System W Satisfies Syntax Splitting

by   Jonas Haldimann, et al.
FernUniversität in Hagen

In this paper, we investigate inductive inference with system W from conditional belief bases with respect to syntax splitting. The concept of syntax splitting for inductive inference states that inferences about independent parts of the signature should not affect each other. This was captured in work by Kern-Isberner, Beierle, and Brewka in the form of postulates for inductive inference operators expressing syntax splitting as a combination of relevance and independence; it was also shown that c-inference fulfils syntax splitting, while system P inference and system Z both fail to satisfy it. System W is a recently introduced inference system for nonmonotonic reasoning that captures and properly extends system Z as well as c-inference. We show that system W fulfils the syntax splitting postulates for inductive inference operators by showing that it satisfies the required properties of relevance and independence. This makes system W another inference operator besides c-inference that fully complies with syntax splitting, while in contrast to c-inference, also extending rational closure.


page 1

page 2

page 3

page 4


Code Generation for Higher Inductive Types

Higher inductive types are inductive types that include nontrivial highe...

Countability of Inductive Types Formalized in the Object-Logic Level

The set of integer number lists with finite length, and the set of binar...

Conditional Inference and Activation of Knowledge Entities in ACT-R

Activation-based conditional inference applies conditional reasoning to ...

Nominal Recursors as Epi-Recursors

We study nominal recursors from the literature on syntax with bindings a...

Nominal Matching Logic

We introduce Nominal Matching Logic (NML) as an extension of Matching Lo...

Large and Infinitary Quotient Inductive-Inductive Types

Quotient inductive-inductive types (QIITs) are generalized inductive typ...

Rensets and Renaming-Based Recursion for Syntax with Bindings

I introduce renaming-enriched sets (rensets for short), which are algebr...