On the representation and querying of sets of possible worlds

DOI10.1016/0304-3975(51)90007-2zbMATH Open0741.68039OpenAlexW2050171146MaRDI QIDQ1174717FDOQ1174717

Paris C. Kanellakis, Gösta Grahne, Serge Abiteboul

Publication date: 25 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(51)90007-2

zbMATH Keywords

data complexityconditioned-tablesincomplete information database

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Incomplete Information in Relational Databases
• The polynomial-time hierarchy
• On the Complexity of Testing Implications of Functional and Join Dependencies
• Testing the universal instance assumption
• On Databases with Incomplete Information
• Horn clause queries and generalizations
• Database relations with null values
• In memoriam Witold Lipski, jun. (1949--1985)
• Structure and complexity of relational queries
• Querying logical databases
• The complexity of evaluating relational queries

Cited In (26)

• Fragments of Bag Relational Algebra: Expressiveness and Certain Answers
• Querying disjunctive databases through nonmonotonic logics
• XML Schema Mappings
• Reasoning about partially ordered events
• On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees
• On indexing evidential data
• Certain answers over incomplete XML documents: extending tractability boundary
• Towards an algebraic theory of information integration
• Querying incomplete information in RDF with SPARQL
• An initial approach to the evaluation of possibilistic queries addressed to possibilistic databases.
• The complexity of querying indefinite data about linearly ordered domains
• Negative Knowledge for Certain Query Answers
• Efficient processing of probabilistic set-containment queries on uncertain set-valued data
• Data exchange and schema mappings in open and closed worlds
• Intuitionistic interpretation of deductive databases with incomplete information
• The complexity of query evaluation in indefinite temporal constraint databases
• Supporting various top-k queries over uncertain datasets
• About the processing of possibilistic queries involving a difference operation
• Constraint satisfaction with an object-oriented knowledge representation language
• Title not available (Why is that?)
• Certain answers as objects and knowledge
• Data cleaning and query answering with matching dependencies and matching functions
• On the semantics of top-\(k\) ranking for objects with uncertain data
• World-set decompositions: Expressiveness and efficient algorithms
• Querying temporal and spatial constraint networks in PTIME
• Recursively indefinite databases

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• World-set decompositions: Expressiveness and efficient algorithms 👍 👎
• Logic Programming 👍 👎
• Open-world probabilistic databases: semantics, algorithms, complexity 👍 👎
• Quantification over sets of possible worlds in branching-time semantics 👍 👎
• Querying Possibilistic Databases: Three Interpretations 👍 👎

This page was built for publication: On the representation and querying of sets of possible worlds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174717)