A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems (Q1664711): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Consistent subsets of inconsistent systems: structure and behaviour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency-based diagnosis of configuration knowledge bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability problems with preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal unsatisfiable subsets of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, flexible MUS enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank

Latest revision as of 11:39, 16 July 2024

scientific article
Language Label Description Also known as
English
A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems
scientific article

    Statements

    A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems (English)
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: The task of finding all the minimal inconsistent subsets plays a vital role in many theoretical works especially in large knowledge bases and it has been proved to be a NP-complete problem. In this work, at first we propose a max-term counting based knowledge inconsistency checking strategy. And, then, we put forward an algorithm for finding all minimal inconsistent subsets, in which we establish a Boolean lattice to organize the subsets of the given knowledge base and use leaf pruning to optimize the algorithm efficiency. Comparative experiments and analysis also show the algorithm's improvement over past approaches. Finally, we give an application for inconsistency measure calculation of fuzzy knowledge based systems.
    0 references
    0 references
    0 references
    0 references