Recovering Information from Inconsistent KB with Bilattice Approach - PowerPoint PPT Presentation

1 / 22
About This Presentation
Title:

Recovering Information from Inconsistent KB with Bilattice Approach

Description:

Any conclusion can be drawn from an inconsistent KB: a ... The logic described above is weak (disjunctive syllogism) Logic in the framework of bilattice(3) ... – PowerPoint PPT presentation

Number of Views:40
Avg rating:3.0/5.0
Slides: 23
Provided by: isPk
Category:

less

Transcript and Presenter's Notes

Title: Recovering Information from Inconsistent KB with Bilattice Approach


1
Recovering Information from Inconsistent KB with
Bilattice Approach
  • Lin Zhangang
  • zglin_at_is.pku.edu.cn

2
Introduction
  • Drawbacks of classical logic
  • Any conclusion can be drawn from an inconsistent
    KB a single contradiction will destroy the
    meaningful data in a KB.
  • Monotonicity insufficient to model human
    commonsense.

3
Introduction(2)
  • The approach of recovering data from an
    inconsistent KB
  • Characteristics
  • Paraconsistent
  • In the framework of bilattice
  • Without changing the syntax
  • The process
  • Switch to framework of bilattice
  • Develop a mechanism of paraconsistent inferences
    (most consistent inference)
  • Computing the support set of the KB

4
Step 1
  • The multi-valued framework

5
Bilattice
  • Definition (Ginsberg)
  • A property

6
Bifilter (designated value)
  • Definition
  • Two candidates for the set of designated value
  • Logical bilattice

7
  • Inconsistency set

8
Step 2
  • Paraconsistent reasoning

9
Logic in the framework of bilattice
  • The language
  • Notations
  • the set of atomic formulae in KB
  • the set of literals in KB
  • Multi-valued Semantics

10
Logic in the framework of bilattice(2)
  • Notation
  • Enhancing the logic
  • The logic described above is weak (disjunctive
    syllogism)

11
Logic in the framework of bilattice(3)
  • Epistemic entailment
  • Notation
  • If scon(KB), then for
  • If smin(KB), then for

12
Normal form of KB
  • Extended clause
  • A normalized KB is a set of extended clauses

13
Step 3
  • Recovering consistent information

14
Classification of atomic formulae

15
Spoiled Literals
  • The core of the inconsistency in KB
  • Not included in the recovering set, easy to
    detect (See below)

16
Recoverable literals
  • The robust part of an inconsistent KB
  • Can be associated with a consistent subset, which
    preserves information about recoverable literals

17
Support sets of recoverable literals

18
Support sets of recoverable literals (2)

19
Damaged literals
  • Literals that a consistent truth value can not
    reliably attached to them.
  • Some observations
  • The existence of a support set for a damaged
    literal is not assured
  • Even if there is a support set for a damaged
    literal, there may be other SS supports its
    negation
  • A literal can be damaged not only because of over
    information, but a lack of data as well

20
Minimal MCM
  • If one is only interested in recovering an
    inconsistent KB, it suffices to consider only the
    k-mimimal models of the mcms.
  • Notation for k-minimal models of the mcms
    of KB

21
Example
  • The KB
  • The k-minimal mcms
  • Support sets

22
  • The End
  • Happy National Day!
Write a Comment
User Comments (0)
About PowerShow.com