The complexity of satisfying constraints on databases of transactions (Q2464038): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4736834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatization of frequent itemsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-Based Mining and Inductive Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Intersection Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime deduction for probabilistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic logic programming with conditional constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank

Latest revision as of 14:03, 27 June 2024

scientific article
Language Label Description Also known as
English
The complexity of satisfying constraints on databases of transactions
scientific article

    Statements

    The complexity of satisfying constraints on databases of transactions (English)
    0 references
    10 December 2007
    0 references
    0 references

    Identifiers