On deciding subsumption problems (Q1777407): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2751045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working with ARMs: Complexity results on atomic representations of Herbrand models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational formulae with membership constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational problems and disunification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4784859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit representation of terms defined by counter examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperresolution and automated model building / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-ground realization of the stable and well-founded semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient-completeness, ground-reducibility and their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATO: An efficient propositional prover / rank
 
Normal rank

Latest revision as of 11:29, 10 June 2024

scientific article
Language Label Description Also known as
English
On deciding subsumption problems
scientific article

    Statements

    On deciding subsumption problems (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2005
    0 references
    0 references
    subsumption
    0 references
    equational problems
    0 references
    satisfiability
    0 references
    QBFs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references