Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q5769706 / 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-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cascade algorithm for the logical closure of a set of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification as a complexity measure for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems for deterministic polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862380 / 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: LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cores and Prime Implicants of Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Question-asking strategies for Horn clause systems / rank
 
Normal rank

Latest revision as of 13:05, 27 May 2024

scientific article
Language Label Description Also known as
English
Polynomial-time inference of all valid implications for Horn and related formulae
scientific article

    Statements

    Polynomial-time inference of all valid implications for Horn and related formulae (English)
    0 references
    14 December 1997
    0 references
    inference problem
    0 references
    Horn formulae
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references