The following pages link to Pablo Barceló (Q388218):
Displaying 40 items.
- Solutions and query rewriting in data exchange (Q388220) (← links)
- Query languages for data exchange: beyond unions of conjunctive queries (Q639842) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Parameterized regular expressions and their languages (Q1944774) (← links)
- On the data complexity of consistent query answering over graph databases (Q2361352) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- Regularizing conjunctive features for classification (Q2662672) (← links)
- Order-invariant types and their applications (Q2800972) (← links)
- Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints (Q2820687) (← links)
- String solving with word equations and transducers: towards a logic for analysing mutation XSS (Q2828250) (← links)
- Graph logics with rational relations (Q2846573) (← links)
- Expressive Path Queries on Graphs with Data (Q2870115) (← links)
- Parameterized regular expressions and their languages (Q2911637) (← links)
- Graph Logics with Rational Relations and the Generalized Intersection Problem (Q2986787) (← links)
- XML with incomplete information (Q2999785) (← links)
- Relational and XML Data Exchange (Q3058302) (← links)
- The complexity of reverse engineering problems for conjunctive queries (Q3174895) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- Querying Regular Graph Patterns (Q3189642) (← links)
- Efficient Approximations of Conjunctive Queries (Q3190694) (← links)
- Expressive Path Queries on Graph with Data (Q3196358) (← links)
- A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
- First-Order and Temporal Logics for Nested Words (Q3623007) (← links)
- (Q4413442) (← links)
- (Q4415107) (← links)
- Bisimulations on Data Graphs (Q4605201) (← links)
- Graph logics with rational relations (Q4635595) (← links)
- Guarded Ontology-Mediated Queries (Q5015964) (← links)
- The Complexity of Counting Problems Over Incomplete Databases (Q5056349) (← links)
- Semantic Optimization of Conjunctive Queries (Q5056448) (← links)
- (Q5091265) (← links)
- (Q5091266) (← links)
- (Q5144653) (← links)
- Graph Logics with Rational Relations (Q5278208) (← links)
- Computer Science Logic (Q5311255) (← links)
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization (Q5428867) (← links)
- On the Data Complexity of Consistent Query Answering over Graph Databases. (Q5738946) (← links)
- Separating automatic relations (Q6647641) (← links)
- When is ontology-mediated querying efficient? (Q6654518) (← links)
