The following pages link to Pierre Senellart (Q778532):
Displaying 18 items.
- (Q269312) (redirect page) (← links)
- Optimal probabilistic generation of XML documents (Q269313) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
- Monadic Datalog Containment (Q3167001) (← links)
- Top-k Querying of Unknown Values under Order Constraints (Q3174893) (← links)
- Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Q3174894) (← links)
- Connecting Width and Structure in Knowledge Compilation (Extended Version) (Q3305349) (← links)
- Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
- Schema mapping discovery from data instances (Q3578189) (← links)
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching (Q4652266) (← links)
- Monadic Datalog, Tree Validity, and Limited Access Containment (Q4972170) (← links)
- An Indexing Framework for Queries on Probabilistic Graphs (Q5012581) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- Databases (Q5397501) (← links)
- Possible and certain answers for queries over order-incomplete data (Q6486418) (← links)
- Provenance in databases: principles and applications (Q6535982) (← links)
