Compilation of Conditional Knowledge Bases for Computing C-Inference Relations

2018 ◽  
pp. 34-54 ◽  
Author(s):  
Christoph Beierle ◽  
Steven Kutsch ◽  
Kai Sauerwald
Keyword(s):  
Knowledge Bases ◽  
Conditional Knowledge

scholarly journals A Complete Map of Conditional Knowledge Bases in Different Normal Forms and Their Induced System P Inference Relations Over Small Signatures

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Christoph Beierle ◽  
Jonas Haldimann ◽  
Steven Kutsch
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Knowledge Bases ◽  
Predominant Role ◽  
New Normal ◽  
Conditional Knowledge ◽  
System P

Conditional knowledge bases consisting of qualitativeconditionals play a predominant role in knowledge representationand reasoning. In this paper, we develop a full map of allconsistent conditional knowledge bases over a small signature indifferent normal forms. We introduce two new normal formsthat take the induced system P inference relation into account,the system P normal form (SPNF) and the renaming SPNF(ρSPNF) considering additionally renamings of theunderlying signature. For a two-element signature, we systematicallygenerate and compare all consistent knowledge bases in ANF,RANF, SPNF, and their renaming counterparts, as well as allcomplete system P inference relations induced by conditionalknowledge bases.

Syntax Splitting = Relevance + Independence: New Postulates for Nonmonotonic Reasoning From Conditional Belief Bases

2020 ◽  
Author(s):  
Gabriele Kern-Isberner ◽  
Christoph Beierle ◽  
Gerhard Brewka
Keyword(s):  
Knowledge Base ◽  
Belief Revision ◽  
Inductive Inference ◽  
Nonmonotonic Reasoning ◽  
Irrelevant Information ◽  
Knowledge Bases ◽  
P System ◽  
Conditional Belief ◽  
Conditional Knowledge ◽  
System P

Syntax splitting, first introduced by Parikh in 1999, is a natural and desirable property of KR systems. Syntax splitting combines two aspects: it requires that the outcome of a certain epistemic operation should only depend on relevant parts of the underlying knowledge base, where relevance is given a syntactic interpretation (relevance). It also requires that strengthening antecedents by irrelevant information should have no influence on the obtained conclusions (independence). In the context of belief revision the study of syntax splitting already proved useful and led to numerous new insights. In this paper we analyse syntax splitting in a different setting, namely nonmonotonic reasoning based on conditional knowledge bases. More precisely, we analyse inductive inference operators which, like system P, system Z, or the more recent c-inference, generate an inference relation from a conditional knowledge base. We axiomatize the two aforementioned aspects of syntax splitting, relevance and independence, as properties of such inductive inference operators. Our main results show that system P and system Z, whilst satisfying relevance, fail to satisfy independence. C-inference, in contrast, turns out to satisfy both relevance and independence and thus fully complies with syntax splitting.

scholarly journals System Z FO : Default reasoning with system Z-like ranking functions for unary first-order conditional knowledge bases

2017 ◽  
Vol 90 ◽  
pp. 120-143
Author(s):  
Christoph Beierle ◽  
Tobias Falke ◽  
Steven Kutsch ◽  
Gabriele Kern-Isberner
Keyword(s):  
Knowledge Bases ◽  
Default Reasoning ◽  
Ranking Functions ◽  
First Order ◽  
Conditional Knowledge
Sign in / Sign up

Export Citation Format

Share Document