Normal forms of conditional knowledge bases respecting system P-entailments and signature renamings
Conditionals are defeasible rules of the form If A then usually B , and they play a central role in many approaches to nonmonotonic reasoning. Normal forms of conditional knowledge bases consisting of a set of such conditionals are useful to create, process, and compare the knowledge represented by...
Gespeichert in:
Veröffentlicht in: | Annals of mathematics and artificial intelligence 2022-03, Vol.90 (2-3), p.149-179 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Conditionals are defeasible rules of the form
If A then usually B
, and they play a central role in many approaches to nonmonotonic reasoning. Normal forms of conditional knowledge bases consisting of a set of such conditionals are useful to create, process, and compare the knowledge represented by them. In this article, we propose several new normal forms for conditional knowledge bases. Compared to the previously introduced antecedent normal form, the
reduced antecedent normal form
(RANF) represents conditional knowledge with significantly fewer conditionals by taking nonmonotonic entailments licenced by system P into account. The
renaming normal form
(ρNF)
addresses equivalences among conditional knowledge bases induced by renamings of the underlying signature. Combining the concept of renaming normal form with other normal forms yields the
renaming antecedent normal form
(
ρ
ANF) and the
renaming reduced antecedent normal form
(
ρ
RANF). For all newly introduced normal forms, we show their key properties regarding, existence, uniqueness, model equivalence, and inferential equivalence, and we develop algorithms transforming every conditional knowledge base into an equivalent knowledge base being in the respective normal form. For the most succinct normal form, the
ρ
RANF, we present an algorithm
K
B
ρ
r
a
systematically generating knowledge bases over a given signature in
ρ
RANF. We show that the generated knowledge bases are consistent, pairwise not antecedentwise equivalent, and pairwise not equivalent under signature renaming. Furthermore, the algorithm is complete in the sense that, when taking signature renamings and model equivalence into account, every consistent knowledge base is generated. Observing that normalizing the set of all knowledge bases over a signature
Σ
to
ρ
RANF yields exactly the same result as
K
B
ρ
r
a
(
Σ
), highlights the interrelationship between normal form transformations on the one hand and systematically generating knowledge bases in normal form on the other hand. |
---|---|
ISSN: | 1012-2443 1573-7470 |
DOI: | 10.1007/s10472-021-09745-3 |