An algorithm to compute maximal contractions for Horn clauses (Q543196): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Wei Li / rank
 
Normal rank
Property / review text
 
In this paper the authors address the problem of computing maximal subsets of a set \(\Gamma\) of formulae which are consistent with a set \(\Delta\) of facts (i.e. maximal contractions). For this, the authors proceed as follows: {\parindent=6,5mm \begin{itemize}\item[(1)] They prove a conversion relationship between minimal inconsistent sets of the union of \(\Gamma\) and \(\Delta\) and maximal contractions. \item[(2)] They give a necessary condition of a set of Horn clauses to be minimal inconsistent. \item[(3)] Based on these two results, they give an algorithm for enumerating all minimal inconsistent subsets of a given set of Horn clauses, and an algorithm for computing the maximal contractions from these minimal inconsistent subsets. \item[(4)] They propose an (interactive) algorithm for computing maximal contractions for Horn clauses by composing the above algorithms. \end{itemize}}
Property / review text: In this paper the authors address the problem of computing maximal subsets of a set \(\Gamma\) of formulae which are consistent with a set \(\Delta\) of facts (i.e. maximal contractions). For this, the authors proceed as follows: {\parindent=6,5mm \begin{itemize}\item[(1)] They prove a conversion relationship between minimal inconsistent sets of the union of \(\Gamma\) and \(\Delta\) and maximal contractions. \item[(2)] They give a necessary condition of a set of Horn clauses to be minimal inconsistent. \item[(3)] Based on these two results, they give an algorithm for enumerating all minimal inconsistent subsets of a given set of Horn clauses, and an algorithm for computing the maximal contractions from these minimal inconsistent subsets. \item[(4)] They propose an (interactive) algorithm for computing maximal contractions for Horn clauses by composing the above algorithms. \end{itemize}} / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Viorica Sofronie-Stokkermans / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B42 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5909055 / rank
 
Normal rank
Property / zbMATH Keywords
 
Horn clause
Property / zbMATH Keywords: Horn clause / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal inconsistent set
Property / zbMATH Keywords: minimal inconsistent set / rank
 
Normal rank
Property / zbMATH Keywords
 
maximal contraction
Property / zbMATH Keywords: maximal contraction / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal subtraction
Property / zbMATH Keywords: minimal subtraction / rank
 
Normal rank
Property / zbMATH Keywords
 
belief revision
Property / zbMATH Keywords: belief revision / rank
 
Normal rank

Revision as of 10:45, 1 July 2023

scientific article
Language Label Description Also known as
English
An algorithm to compute maximal contractions for Horn clauses
scientific article

    Statements

    An algorithm to compute maximal contractions for Horn clauses (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    In this paper the authors address the problem of computing maximal subsets of a set \(\Gamma\) of formulae which are consistent with a set \(\Delta\) of facts (i.e. maximal contractions). For this, the authors proceed as follows: {\parindent=6,5mm \begin{itemize}\item[(1)] They prove a conversion relationship between minimal inconsistent sets of the union of \(\Gamma\) and \(\Delta\) and maximal contractions. \item[(2)] They give a necessary condition of a set of Horn clauses to be minimal inconsistent. \item[(3)] Based on these two results, they give an algorithm for enumerating all minimal inconsistent subsets of a given set of Horn clauses, and an algorithm for computing the maximal contractions from these minimal inconsistent subsets. \item[(4)] They propose an (interactive) algorithm for computing maximal contractions for Horn clauses by composing the above algorithms. \end{itemize}}
    0 references
    Horn clause
    0 references
    minimal inconsistent set
    0 references
    maximal contraction
    0 references
    minimal subtraction
    0 references
    belief revision
    0 references

    Identifiers