World-set decompositions: Expressiveness and efficient algorithms (Q944380): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150137825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation and querying of sets of possible worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: World-set decompositions: Expressiveness and efficient algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer sets for consistent query answering in inconsistent databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring logic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of incomplete information in relational databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Information in Relational Databases / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:17, 28 June 2024

scientific article
Language Label Description Also known as
English
World-set decompositions: Expressiveness and efficient algorithms
scientific article

    Statements

    World-set decompositions: Expressiveness and efficient algorithms (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2008
    0 references
    databases
    0 references
    incomplete information
    0 references
    representation systems
    0 references
    relational factorization
    0 references

    Identifiers