Variable and term removal from Boolean formulae (Q1363769): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Index for Satisfiability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting embedded Horn structure in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for testing the satisfiability of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming a Set of Clauses as a Horn Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Revision as of 17:12, 27 May 2024

scientific article
Language Label Description Also known as
English
Variable and term removal from Boolean formulae
scientific article

    Statements

    Variable and term removal from Boolean formulae (English)
    0 references
    0 references
    0 references
    0 references
    26 January 1998
    0 references
    Disjunctive normal forms (DNF's) \(\Phi\) over a set (of variables) \(V= \{x_1, x_2, \dots, x_n\}\) are considered. A subset \(\pi\) of the set of all DNF's (over \(V)\) is called a property. The fulfilment of four conditions (1)--(4) is supposed where (1) the trivial DNF's \(\Lambda\) and \(\Phi\) (i.e. the simplest DNF's that represent the constants 0 and 1, resp.) belong to \(\pi\), (2) there is a DNF \(\Phi\) such that \(\Phi \notin \pi\), (3) whenever every term of a DNF \(\Phi\) is a single literal, then \(\Phi \in \pi\), (4) if \(\Phi \in \pi\) and \(\Phi'\) is got by deleting a term from \(\Phi\), then \(\Phi' \in \pi\). Strengthening Condition (4), we say that \(\pi\) is a term-induced property if the containment \(\Phi \in \pi\) and the sentence ``every term of \(\Phi\) belongs to \(\pi\)'' are equivalent. Let a property \(\pi\), a DNF \(\Phi\) and a subset \(S\) of \(V\) be given. Let \(\Phi \backslash S\) be the DNF which is obtained from \(\Phi\) by deleting each occurrence (noncomplemented or complemented) of the elements of \(S\), we say that \(S\) is a VD-set of \(\Phi\) for \(\pi\) if \(\Phi \backslash S\in \pi\). We can get \(2^{|S|}\) DNF's from \(\Phi\) by fixing the elements of \(S\) (to the values 0 or 1), we say that \(S\) is a VF-set of \(\Phi\) for \(\pi\) if all these \(2^{|S|}\) DNF's belong to \(\pi\). Let us mention two typical results. If \((\Phi,S\) are arbitrary and) \(\pi\) is a term-induced property, then the VD-sets and VF-sets coincide. For any \(\pi\), the task of finding a minimum cardinality VD-set is NP-hard.
    0 references
    Boolean functions
    0 references
    disjunctive normal forms
    0 references
    VD-sets
    0 references
    VF-sets
    0 references

    Identifiers