On renamable Horn and generalized Horn functions (Q1356207): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing disguised NR(1) instances of the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results and experiments in programming techniques for propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming is log-space hard for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the satisfiability of modal Horn clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: HORNLOG: A graph-based interpreter for general Horn clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Refutations and Horn Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On renaming a set of clauses as a Horn set / 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: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic / rank
 
Normal rank

Revision as of 13:05, 27 May 2024

scientific article
Language Label Description Also known as
English
On renamable Horn and generalized Horn functions
scientific article

    Statements

    On renamable Horn and generalized Horn functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 December 1997
    0 references
    Horn function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references